About the Execution of GreatSPN+red for FireWire-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1562.991 | 811962.00 | 955012.00 | 1920.30 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r549-tall-171734898200269.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 FireWire-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898200269
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 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 FireWire-PT-13-UpperBounds-00
FORMULA_NAME FireWire-PT-13-UpperBounds-01
FORMULA_NAME FireWire-PT-13-UpperBounds-02
FORMULA_NAME FireWire-PT-13-UpperBounds-03
FORMULA_NAME FireWire-PT-13-UpperBounds-04
FORMULA_NAME FireWire-PT-13-UpperBounds-05
FORMULA_NAME FireWire-PT-13-UpperBounds-06
FORMULA_NAME FireWire-PT-13-UpperBounds-07
FORMULA_NAME FireWire-PT-13-UpperBounds-08
FORMULA_NAME FireWire-PT-13-UpperBounds-09
FORMULA_NAME FireWire-PT-13-UpperBounds-10
FORMULA_NAME FireWire-PT-13-UpperBounds-11
FORMULA_NAME FireWire-PT-13-UpperBounds-12
FORMULA_NAME FireWire-PT-13-UpperBounds-13
FORMULA_NAME FireWire-PT-13-UpperBounds-14
FORMULA_NAME FireWire-PT-13-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717369477234
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:04:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 23:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:04:38] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2024-06-02 23:04:38] [INFO ] Transformed 205 places.
[2024-06-02 23:04:38] [INFO ] Transformed 610 transitions.
[2024-06-02 23:04:38] [INFO ] Found NUPN structural information;
[2024-06-02 23:04:38] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 23:04:38] [INFO ] Flow matrix only has 504 transitions (discarded 38 similar events)
// Phase 1: matrix 504 rows 205 cols
[2024-06-02 23:04:38] [INFO ] Computed 10 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (286 resets) in 72 ms. (136 steps per ms)
FORMULA FireWire-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90005 steps (530 resets) in 117 ms. (762 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 23:04:39] [INFO ] Flow matrix only has 504 transitions (discarded 38 similar events)
[2024-06-02 23:04:39] [INFO ] Invariant cache hit.
[2024-06-02 23:04:39] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 23:04:39] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-06-02 23:04:39] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 23:04:39] [INFO ] [Real]Added 73 Read/Feed constraints in 43 ms returned sat
[2024-06-02 23:04:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-02 23:04:39] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-06-02 23:04:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 43 ms returned sat
[2024-06-02 23:04:39] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 70 ms.
[2024-06-02 23:04:40] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 15 ms to minimize.
[2024-06-02 23:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-06-02 23:04:40] [INFO ] Added : 34 causal constraints over 9 iterations in 589 ms. Result :sat
Minimization took 190 ms.
[2024-06-02 23:04:40] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-02 23:04:40] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-06-02 23:04:40] [INFO ] [Real]Added 73 Read/Feed constraints in 31 ms returned sat
[2024-06-02 23:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:40] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-02 23:04:40] [INFO ] [Nat]Added 73 Read/Feed constraints in 49 ms returned sat
[2024-06-02 23:04:41] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 52 ms.
[2024-06-02 23:04:41] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-06-02 23:04:41] [INFO ] Added : 28 causal constraints over 7 iterations in 493 ms. Result :sat
Minimization took 140 ms.
[2024-06-02 23:04:41] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-02 23:04:41] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-02 23:04:41] [INFO ] [Real]Added 73 Read/Feed constraints in 45 ms returned sat
[2024-06-02 23:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:42] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-02 23:04:42] [INFO ] [Nat]Added 73 Read/Feed constraints in 48 ms returned sat
[2024-06-02 23:04:42] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 37 ms.
[2024-06-02 23:04:42] [INFO ] Added : 10 causal constraints over 2 iterations in 160 ms. Result :sat
Minimization took 117 ms.
[2024-06-02 23:04:42] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:42] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-02 23:04:42] [INFO ] [Real]Added 73 Read/Feed constraints in 10 ms returned sat
[2024-06-02 23:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:42] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-02 23:04:42] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2024-06-02 23:04:42] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 42 ms.
[2024-06-02 23:04:43] [INFO ] Added : 34 causal constraints over 7 iterations in 307 ms. Result :sat
Minimization took 125 ms.
[2024-06-02 23:04:43] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:43] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-02 23:04:43] [INFO ] [Real]Added 73 Read/Feed constraints in 36 ms returned sat
[2024-06-02 23:04:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:43] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-02 23:04:43] [INFO ] [Nat]Added 73 Read/Feed constraints in 69 ms returned sat
[2024-06-02 23:04:43] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 39 ms.
[2024-06-02 23:04:43] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:04:44] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:04:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2024-06-02 23:04:44] [INFO ] Added : 31 causal constraints over 8 iterations in 582 ms. Result :sat
Minimization took 125 ms.
[2024-06-02 23:04:44] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:44] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-02 23:04:44] [INFO ] [Real]Added 73 Read/Feed constraints in 38 ms returned sat
[2024-06-02 23:04:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:44] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-06-02 23:04:44] [INFO ] [Nat]Added 73 Read/Feed constraints in 76 ms returned sat
[2024-06-02 23:04:44] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 37 ms.
[2024-06-02 23:04:45] [INFO ] Added : 12 causal constraints over 3 iterations in 165 ms. Result :sat
Minimization took 124 ms.
[2024-06-02 23:04:45] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-02 23:04:45] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-06-02 23:04:45] [INFO ] [Real]Added 73 Read/Feed constraints in 14 ms returned sat
[2024-06-02 23:04:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:45] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-02 23:04:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 54 ms returned sat
[2024-06-02 23:04:45] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 32 ms.
[2024-06-02 23:04:45] [INFO ] Added : 16 causal constraints over 4 iterations in 186 ms. Result :sat
Minimization took 124 ms.
[2024-06-02 23:04:46] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:46] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-02 23:04:46] [INFO ] [Real]Added 73 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:04:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:46] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 23:04:46] [INFO ] [Nat]Added 73 Read/Feed constraints in 74 ms returned sat
[2024-06-02 23:04:46] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 28 ms.
[2024-06-02 23:04:46] [INFO ] Added : 12 causal constraints over 3 iterations in 155 ms. Result :sat
Minimization took 118 ms.
[2024-06-02 23:04:46] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:46] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-02 23:04:46] [INFO ] [Real]Added 73 Read/Feed constraints in 42 ms returned sat
[2024-06-02 23:04:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:04:47] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-02 23:04:47] [INFO ] [Nat]Added 73 Read/Feed constraints in 75 ms returned sat
[2024-06-02 23:04:47] [INFO ] Computed and/alt/rep : 211/821/211 causal constraints (skipped 292 transitions) in 40 ms.
[2024-06-02 23:04:47] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-06-02 23:04:47] [INFO ] Added : 24 causal constraints over 5 iterations in 333 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 542/542 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 539
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 536
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 536
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 196 transition count 524
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 196 transition count 524
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 196 transition count 521
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 193 transition count 512
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 193 transition count 512
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 190 transition count 506
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 190 transition count 506
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 187 transition count 497
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 187 transition count 497
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 185 transition count 493
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 185 transition count 493
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 183 transition count 487
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 183 transition count 487
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 182 transition count 485
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 182 transition count 485
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 181 transition count 482
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 181 transition count 482
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 180 transition count 480
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 180 transition count 480
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 179 transition count 477
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 179 transition count 477
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 177 transition count 475
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 174 transition count 481
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 74 place count 174 transition count 475
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 83 place count 174 transition count 466
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 174 transition count 472
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 95 place count 171 transition count 466
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 101 place count 171 transition count 460
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 170 transition count 459
Applied a total of 102 rules in 176 ms. Remains 170 /205 variables (removed 35) and now considering 459/542 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 170/205 places, 459/542 transitions.
[2024-06-02 23:04:48] [INFO ] Flow matrix only has 422 transitions (discarded 37 similar events)
// Phase 1: matrix 422 rows 170 cols
[2024-06-02 23:04:48] [INFO ] Computed 10 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32123 resets) in 1635 ms. (611 steps per ms)
FORMULA FireWire-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000006 steps (48032 resets) in 3430 ms. (2040 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-02 23:04:53] [INFO ] Flow matrix only has 422 transitions (discarded 37 similar events)
[2024-06-02 23:04:53] [INFO ] Invariant cache hit.
[2024-06-02 23:04:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:53] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 23:04:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:04:53] [INFO ] [Real]Added 61 Read/Feed constraints in 20 ms returned sat
[2024-06-02 23:04:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:53] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 23:04:53] [INFO ] [Nat]Added 61 Read/Feed constraints in 30 ms returned sat
[2024-06-02 23:04:53] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:04:53] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 3 ms to minimize.
[2024-06-02 23:04:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2024-06-02 23:04:53] [INFO ] Computed and/alt/rep : 171/627/171 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 23:04:53] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-06-02 23:04:54] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 5 ms to minimize.
[2024-06-02 23:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-06-02 23:04:54] [INFO ] Added : 20 causal constraints over 6 iterations in 398 ms. Result :sat
Minimization took 173 ms.
[2024-06-02 23:04:54] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:54] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 23:04:54] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 23:04:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:54] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-02 23:04:54] [INFO ] [Nat]Added 61 Read/Feed constraints in 32 ms returned sat
[2024-06-02 23:04:54] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-06-02 23:04:54] [INFO ] Computed and/alt/rep : 171/627/171 causal constraints (skipped 245 transitions) in 31 ms.
[2024-06-02 23:04:54] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 23:04:55] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:04:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-06-02 23:04:55] [INFO ] Added : 49 causal constraints over 12 iterations in 480 ms. Result :sat
Minimization took 190 ms.
[2024-06-02 23:04:55] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Real]Added 61 Read/Feed constraints in 45 ms returned sat
[2024-06-02 23:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Nat]Added 61 Read/Feed constraints in 27 ms returned sat
[2024-06-02 23:04:55] [INFO ] Computed and/alt/rep : 171/627/171 causal constraints (skipped 245 transitions) in 28 ms.
[2024-06-02 23:04:55] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 23:04:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-06-02 23:04:56] [INFO ] Added : 29 causal constraints over 7 iterations in 287 ms. Result :sat
Minimization took 188 ms.
[2024-06-02 23:04:56] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:56] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-02 23:04:56] [INFO ] [Real]Added 61 Read/Feed constraints in 6 ms returned sat
[2024-06-02 23:04:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-02 23:04:56] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-02 23:04:56] [INFO ] [Nat]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 23:04:56] [INFO ] Computed and/alt/rep : 171/627/171 causal constraints (skipped 245 transitions) in 28 ms.
[2024-06-02 23:04:56] [INFO ] Added : 27 causal constraints over 6 iterations in 192 ms. Result :sat
Minimization took 178 ms.
[2024-06-02 23:04:56] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Real]Added 61 Read/Feed constraints in 21 ms returned sat
[2024-06-02 23:04:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Nat]Added 61 Read/Feed constraints in 71 ms returned sat
[2024-06-02 23:04:57] [INFO ] Computed and/alt/rep : 171/627/171 causal constraints (skipped 245 transitions) in 28 ms.
[2024-06-02 23:04:57] [INFO ] Added : 26 causal constraints over 6 iterations in 190 ms. Result :sat
Minimization took 187 ms.
[2024-06-02 23:04:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Real]Added 61 Read/Feed constraints in 9 ms returned sat
[2024-06-02 23:04:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Nat]Added 61 Read/Feed constraints in 33 ms returned sat
[2024-06-02 23:04:57] [INFO ] Computed and/alt/rep : 171/627/171 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 23:04:58] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:04:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-06-02 23:04:58] [INFO ] Added : 26 causal constraints over 6 iterations in 301 ms. Result :sat
Minimization took 176 ms.
[2024-06-02 23:04:58] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Real]Added 61 Read/Feed constraints in 14 ms returned sat
[2024-06-02 23:04:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Nat]Added 61 Read/Feed constraints in 22 ms returned sat
[2024-06-02 23:04:58] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:04:58] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:04:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2024-06-02 23:04:58] [INFO ] Computed and/alt/rep : 171/627/171 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 23:04:59] [INFO ] Added : 48 causal constraints over 10 iterations in 300 ms. Result :sat
Minimization took 192 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 459/459 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 458
Applied a total of 2 rules in 14 ms. Remains 169 /170 variables (removed 1) and now considering 458/459 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 169/170 places, 458/459 transitions.
[2024-06-02 23:04:59] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 169 cols
[2024-06-02 23:04:59] [INFO ] Computed 10 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32096 resets) in 1591 ms. (628 steps per ms)
BEST_FIRST walk for 5000005 steps (34250 resets) in 2527 ms. (1977 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-02 23:05:03] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:05:03] [INFO ] Invariant cache hit.
[2024-06-02 23:05:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:03] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 23:05:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:05:03] [INFO ] [Real]Added 61 Read/Feed constraints in 14 ms returned sat
[2024-06-02 23:05:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:03] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-02 23:05:03] [INFO ] [Nat]Added 61 Read/Feed constraints in 24 ms returned sat
[2024-06-02 23:05:03] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 22 ms.
[2024-06-02 23:05:04] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:05:04] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:05:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2024-06-02 23:05:04] [INFO ] Added : 24 causal constraints over 6 iterations in 415 ms. Result :sat
Minimization took 120 ms.
[2024-06-02 23:05:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:04] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-02 23:05:04] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 23:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:04] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:05:04] [INFO ] [Nat]Added 61 Read/Feed constraints in 22 ms returned sat
[2024-06-02 23:05:04] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 23:05:04] [INFO ] Added : 28 causal constraints over 6 iterations in 188 ms. Result :sat
Minimization took 119 ms.
[2024-06-02 23:05:05] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:05] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-02 23:05:05] [INFO ] [Real]Added 61 Read/Feed constraints in 24 ms returned sat
[2024-06-02 23:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:05] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:05:05] [INFO ] [Nat]Added 61 Read/Feed constraints in 38 ms returned sat
[2024-06-02 23:05:05] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-06-02 23:05:05] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 23:05:05] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-06-02 23:05:05] [INFO ] Added : 32 causal constraints over 9 iterations in 325 ms. Result :sat
Minimization took 126 ms.
[2024-06-02 23:05:06] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:06] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:05:06] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 23:05:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:06] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-02 23:05:06] [INFO ] [Nat]Added 61 Read/Feed constraints in 35 ms returned sat
[2024-06-02 23:05:06] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 27 ms.
[2024-06-02 23:05:06] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:05:06] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 5 ms to minimize.
[2024-06-02 23:05:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2024-06-02 23:05:06] [INFO ] Added : 30 causal constraints over 8 iterations in 452 ms. Result :sat
Minimization took 120 ms.
[2024-06-02 23:05:06] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:05:07] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-02 23:05:07] [INFO ] [Real]Added 61 Read/Feed constraints in 30 ms returned sat
[2024-06-02 23:05:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:07] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 23:05:07] [INFO ] [Nat]Added 61 Read/Feed constraints in 38 ms returned sat
[2024-06-02 23:05:07] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 27 ms.
[2024-06-02 23:05:07] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:05:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-02 23:05:07] [INFO ] Added : 18 causal constraints over 4 iterations in 220 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 458/458 transitions.
Applied a total of 0 rules in 9 ms. Remains 169 /169 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 169/169 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 458/458 transitions.
Applied a total of 0 rules in 8 ms. Remains 169 /169 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2024-06-02 23:05:07] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:05:07] [INFO ] Invariant cache hit.
[2024-06-02 23:05:07] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-02 23:05:07] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:05:07] [INFO ] Invariant cache hit.
[2024-06-02 23:05:08] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:05:08] [INFO ] Implicit Places using invariants and state equation in 294 ms returned [18, 71, 126]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 538 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/169 places, 458/458 transitions.
Applied a total of 0 rules in 11 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 563 ms. Remains : 166/169 places, 458/458 transitions.
[2024-06-02 23:05:08] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 23:05:08] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (31992 resets) in 1549 ms. (645 steps per ms)
BEST_FIRST walk for 5000004 steps (34168 resets) in 2400 ms. (2082 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-02 23:05:12] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:05:12] [INFO ] Invariant cache hit.
[2024-06-02 23:05:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:12] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 23:05:12] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:05:12] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 23:05:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:12] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:05:12] [INFO ] [Nat]Added 61 Read/Feed constraints in 16 ms returned sat
[2024-06-02 23:05:12] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:05:12] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:05:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2024-06-02 23:05:12] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 22 ms.
[2024-06-02 23:05:13] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-06-02 23:05:13] [INFO ] Added : 39 causal constraints over 9 iterations in 384 ms. Result :sat
Minimization took 147 ms.
[2024-06-02 23:05:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:13] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 23:05:13] [INFO ] [Real]Added 61 Read/Feed constraints in 21 ms returned sat
[2024-06-02 23:05:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:13] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 23:05:13] [INFO ] [Nat]Added 61 Read/Feed constraints in 62 ms returned sat
[2024-06-02 23:05:13] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 23:05:13] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:05:14] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:05:14] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:05:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 326 ms
[2024-06-02 23:05:14] [INFO ] Added : 38 causal constraints over 10 iterations in 583 ms. Result :sat
Minimization took 146 ms.
[2024-06-02 23:05:14] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:14] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-02 23:05:14] [INFO ] [Real]Added 61 Read/Feed constraints in 21 ms returned sat
[2024-06-02 23:05:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:14] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:05:14] [INFO ] [Nat]Added 61 Read/Feed constraints in 33 ms returned sat
[2024-06-02 23:05:14] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 26 ms.
[2024-06-02 23:05:14] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-06-02 23:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-06-02 23:05:14] [INFO ] Added : 22 causal constraints over 5 iterations in 241 ms. Result :sat
Minimization took 154 ms.
[2024-06-02 23:05:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:15] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:05:15] [INFO ] [Real]Added 61 Read/Feed constraints in 16 ms returned sat
[2024-06-02 23:05:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:15] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-02 23:05:15] [INFO ] [Nat]Added 61 Read/Feed constraints in 27 ms returned sat
[2024-06-02 23:05:15] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 23 ms.
[2024-06-02 23:05:15] [INFO ] Added : 20 causal constraints over 4 iterations in 131 ms. Result :sat
Minimization took 150 ms.
[2024-06-02 23:05:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:15] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 23:05:15] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 23:05:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:15] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-02 23:05:15] [INFO ] [Nat]Added 61 Read/Feed constraints in 19 ms returned sat
[2024-06-02 23:05:16] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 26 ms.
[2024-06-02 23:05:16] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-06-02 23:05:16] [INFO ] Added : 21 causal constraints over 6 iterations in 284 ms. Result :sat
Minimization took 154 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 166/166 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2024-06-02 23:05:16] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:05:16] [INFO ] Invariant cache hit.
[2024-06-02 23:05:16] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 23:05:16] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:05:16] [INFO ] Invariant cache hit.
[2024-06-02 23:05:16] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:05:16] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-02 23:05:16] [INFO ] Redundant transitions in 29 ms returned []
Running 452 sub problems to find dead transitions.
[2024-06-02 23:05:16] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:05:16] [INFO ] Invariant cache hit.
[2024-06-02 23:05:16] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:05:19] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:05:19] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:05:19] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:05:19] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 23:05:20] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:05:20] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:05:20] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:05:20] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:05:21] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:05:23] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 421/587 variables, 166/183 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:05:28] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:05:28] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:05:29] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:05:30] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:05:30] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:05:38] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:05:38] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/587 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/587 variables, and 251 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:05:49] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 421/587 variables, 166/191 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 61/252 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 452/704 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/587 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/587 variables, and 705 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 19/19 constraints]
After SMT, in 60639ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60661ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61077 ms. Remains : 166/166 places, 458/458 transitions.
RANDOM walk for 40000 steps (1282 resets) in 1389 ms. (28 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (284 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (272 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (279 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (277 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (291 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (281 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (254 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (277 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (261 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (272 resets) in 72 ms. (547 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 412672 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 10
Probabilistic random walk after 412672 steps, saw 110068 distinct states, run finished after 3004 ms. (steps per millisecond=137 ) properties seen :0
[2024-06-02 23:06:21] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:06:21] [INFO ] Invariant cache hit.
[2024-06-02 23:06:21] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 400/536 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/583 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 61/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/584 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:06:22] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 3/587 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/587 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 235 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1376 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 400/536 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/583 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 61/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 10/239 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 3/587 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:06:23] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/587 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 246 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 2408ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 587 ms.
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 8 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 166/166 places, 458/458 transitions.
RANDOM walk for 40000 steps (1265 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (268 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (260 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (273 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (293 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (262 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (256 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (289 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (249 resets) in 39 ms. (1000 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (257 resets) in 44 ms. (888 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (273 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 411938 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 10
Probabilistic random walk after 411938 steps, saw 109920 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2024-06-02 23:06:27] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:06:27] [INFO ] Invariant cache hit.
[2024-06-02 23:06:27] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 400/536 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/583 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 61/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/584 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:06:28] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 3/587 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/587 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 235 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 400/536 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/583 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 61/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 10/239 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 3/587 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:06:29] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/587 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 246 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 2221ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 586 ms.
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 166/166 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 458/458 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2024-06-02 23:06:30] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:06:30] [INFO ] Invariant cache hit.
[2024-06-02 23:06:30] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:06:30] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:06:30] [INFO ] Invariant cache hit.
[2024-06-02 23:06:30] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:06:30] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-06-02 23:06:30] [INFO ] Redundant transitions in 12 ms returned []
Running 452 sub problems to find dead transitions.
[2024-06-02 23:06:30] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:06:30] [INFO ] Invariant cache hit.
[2024-06-02 23:06:30] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:06:32] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:06:33] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:06:33] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:06:33] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:06:33] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:06:34] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:06:34] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 23:06:34] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:06:35] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:06:37] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 421/587 variables, 166/183 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:06:41] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:06:42] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:06:43] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:06:44] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:06:44] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:06:52] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:06:52] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/587 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/587 variables, and 251 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 421/587 variables, 166/191 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 61/252 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 452/704 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:07:26] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/587 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/587 variables, and 705 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 19/19 constraints]
After SMT, in 60468ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60872 ms. Remains : 166/166 places, 458/458 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 166 vertex of which 29 / 166 are part of one of the 4 SCC in 5 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 140 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 140 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 139 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 139 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 138 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 137 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 137 transition count 254
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 137 transition count 239
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 128 transition count 236
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 128 transition count 236
Applied a total of 46 rules in 43 ms. Remains 128 /166 variables (removed 38) and now considering 236/458 (removed 222) transitions.
Running SMT prover for 10 properties.
[2024-06-02 23:07:31] [INFO ] Flow matrix only has 234 transitions (discarded 2 similar events)
// Phase 1: matrix 234 rows 128 cols
[2024-06-02 23:07:31] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:07:31] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:07:31] [INFO ] After 110ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:4
TRAPS : Iteration 0
[2024-06-02 23:07:31] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 23:07:31] [INFO ] After 250ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 23:07:31] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 23:07:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:07:31] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-06-02 23:07:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:07:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-02 23:07:32] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:07:32] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:07:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
TRAPS : Iteration 1
[2024-06-02 23:07:32] [INFO ] After 527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-02 23:07:32] [INFO ] After 668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 1046 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Starting property specific reduction for FireWire-PT-13-UpperBounds-00
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:07:32] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 23:07:32] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (351 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (70 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:07:32] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:07:32] [INFO ] Invariant cache hit.
[2024-06-02 23:07:32] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:07:32] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 23:07:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:07:32] [INFO ] [Real]Added 61 Read/Feed constraints in 17 ms returned sat
[2024-06-02 23:07:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:07:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:07:32] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:07:32] [INFO ] [Nat]Added 61 Read/Feed constraints in 16 ms returned sat
[2024-06-02 23:07:32] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:07:32] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:07:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2024-06-02 23:07:33] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 23:07:33] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-06-02 23:07:33] [INFO ] Added : 39 causal constraints over 9 iterations in 375 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p97) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 455/455 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 165 transition count 453
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 450
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 163 transition count 448
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 162 transition count 445
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 161 transition count 443
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 7 place count 159 transition count 439
Iterating global reduction 5 with 2 rules applied. Total rules applied 9 place count 159 transition count 439
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 11 place count 157 transition count 434
Iterating global reduction 5 with 2 rules applied. Total rules applied 13 place count 157 transition count 434
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 15 place count 155 transition count 430
Iterating global reduction 5 with 2 rules applied. Total rules applied 17 place count 155 transition count 430
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 18 place count 154 transition count 427
Iterating global reduction 5 with 1 rules applied. Total rules applied 19 place count 154 transition count 427
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 20 place count 153 transition count 425
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 153 transition count 425
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 22 place count 152 transition count 423
Iterating global reduction 5 with 1 rules applied. Total rules applied 23 place count 152 transition count 423
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 24 place count 151 transition count 421
Iterating global reduction 5 with 1 rules applied. Total rules applied 25 place count 151 transition count 421
Applied a total of 25 rules in 27 ms. Remains 151 /166 variables (removed 15) and now considering 421/455 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 151/166 places, 421/455 transitions.
[2024-06-02 23:07:33] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 151 cols
[2024-06-02 23:07:33] [INFO ] Computed 7 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32168 resets) in 1390 ms. (718 steps per ms)
BEST_FIRST walk for 1000001 steps (6748 resets) in 456 ms. (2188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:07:35] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 23:07:35] [INFO ] Invariant cache hit.
[2024-06-02 23:07:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:07:35] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-02 23:07:35] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:07:35] [INFO ] [Real]Added 56 Read/Feed constraints in 15 ms returned sat
[2024-06-02 23:07:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:07:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:07:35] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-02 23:07:35] [INFO ] [Nat]Added 56 Read/Feed constraints in 13 ms returned sat
[2024-06-02 23:07:35] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:07:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-06-02 23:07:35] [INFO ] Computed and/alt/rep : 158/578/158 causal constraints (skipped 220 transitions) in 23 ms.
[2024-06-02 23:07:36] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:07:36] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:07:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2024-06-02 23:07:36] [INFO ] Added : 39 causal constraints over 8 iterations in 427 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 151/151 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-02 23:07:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 23:07:36] [INFO ] Invariant cache hit.
[2024-06-02 23:07:36] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:07:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 23:07:36] [INFO ] Invariant cache hit.
[2024-06-02 23:07:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:07:36] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-02 23:07:36] [INFO ] Redundant transitions in 3 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-02 23:07:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 23:07:36] [INFO ] Invariant cache hit.
[2024-06-02 23:07:36] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:07:38] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:07:38] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:07:42] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:07:42] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:07:42] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:07:42] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:07:42] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:07:43] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:07:44] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:07:44] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:07:44] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (OVERLAPS) 384/535 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:07:49] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:07:49] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:07:51] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:07:57] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:07:57] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 12 (OVERLAPS) 0/535 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 230 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 384/535 variables, 151/174 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 56/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 415/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 645 constraints, problems are : Problem set: 0 solved, 415 unsolved in 26440 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints]
After SMT, in 56778ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 56782ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57137 ms. Remains : 151/151 places, 421/421 transitions.
RANDOM walk for 40000 steps (1260 resets) in 225 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (259 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (288 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 744382 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 2
Probabilistic random walk after 744382 steps, saw 183651 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
[2024-06-02 23:08:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 23:08:36] [INFO ] Invariant cache hit.
[2024-06-02 23:08:36] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/356 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/515 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/533 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/535 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/356 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/515 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/533 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/535 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 151/151 places, 421/421 transitions.
RANDOM walk for 40000 steps (1285 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (260 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (274 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 732807 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 2
Probabilistic random walk after 732807 steps, saw 181508 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
[2024-06-02 23:08:40] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 23:08:40] [INFO ] Invariant cache hit.
[2024-06-02 23:08:40] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/356 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/515 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/533 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/535 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/535 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/355 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/356 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/515 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/533 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/535 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 151/151 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-02 23:08:40] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 23:08:40] [INFO ] Invariant cache hit.
[2024-06-02 23:08:40] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:08:40] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 23:08:40] [INFO ] Invariant cache hit.
[2024-06-02 23:08:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:41] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-06-02 23:08:41] [INFO ] Redundant transitions in 3 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-02 23:08:41] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 23:08:41] [INFO ] Invariant cache hit.
[2024-06-02 23:08:41] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:08:42] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:08:43] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:08:46] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:08:46] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:08:46] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:08:46] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:08:46] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:08:47] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:08:48] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:08:48] [INFO ] Deduced a trap composed of 99 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:08:48] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (OVERLAPS) 384/535 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:08:53] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:08:53] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:08:56] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 23:09:02] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-06-02 23:09:02] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 12 (OVERLAPS) 0/535 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 230 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 384/535 variables, 151/174 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 56/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 415/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 645 constraints, problems are : Problem set: 0 solved, 415 unsolved in 25727 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints]
After SMT, in 56059ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 56064ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56389 ms. Remains : 151/151 places, 421/421 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 151 vertex of which 29 / 151 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 125 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 124 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 124 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 123 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 122 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 122 transition count 224
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 122 transition count 209
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 113 transition count 206
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 113 transition count 206
Applied a total of 46 rules in 26 ms. Remains 113 /151 variables (removed 38) and now considering 206/421 (removed 215) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:09:37] [INFO ] Flow matrix only has 204 transitions (discarded 2 similar events)
// Phase 1: matrix 204 rows 113 cols
[2024-06-02 23:09:37] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:09:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:09:37] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:09:37] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-02 23:09:37] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 171 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-00 in 124861 ms.
Starting property specific reduction for FireWire-PT-13-UpperBounds-02
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:09:37] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 23:09:37] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (336 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (75 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:09:37] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:09:37] [INFO ] Invariant cache hit.
[2024-06-02 23:09:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:09:37] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:09:37] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:09:37] [INFO ] [Real]Added 61 Read/Feed constraints in 21 ms returned sat
[2024-06-02 23:09:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:09:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:09:37] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-02 23:09:37] [INFO ] [Nat]Added 61 Read/Feed constraints in 62 ms returned sat
[2024-06-02 23:09:37] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 40 ms.
[2024-06-02 23:09:38] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:09:38] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:09:38] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:09:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 327 ms
[2024-06-02 23:09:38] [INFO ] Added : 38 causal constraints over 10 iterations in 610 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p30) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 456/456 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 164 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 164 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 162 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 160 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 160 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 159 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 159 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 158 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 158 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 157 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 157 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 156 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 156 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 155 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 155 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 154 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 154 transition count 429
Applied a total of 24 rules in 22 ms. Remains 154 /166 variables (removed 12) and now considering 429/456 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 154/166 places, 429/456 transitions.
[2024-06-02 23:09:38] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
// Phase 1: matrix 392 rows 154 cols
[2024-06-02 23:09:38] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32068 resets) in 1436 ms. (695 steps per ms)
BEST_FIRST walk for 1000001 steps (6798 resets) in 461 ms. (2164 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:09:40] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 23:09:40] [INFO ] Invariant cache hit.
[2024-06-02 23:09:40] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:09:40] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 23:09:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:09:40] [INFO ] [Real]Added 58 Read/Feed constraints in 59 ms returned sat
[2024-06-02 23:09:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:09:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:09:40] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 23:09:40] [INFO ] [Nat]Added 58 Read/Feed constraints in 24 ms returned sat
[2024-06-02 23:09:40] [INFO ] Computed and/alt/rep : 162/590/162 causal constraints (skipped 224 transitions) in 23 ms.
[2024-06-02 23:09:41] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:09:41] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:09:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2024-06-02 23:09:41] [INFO ] Added : 51 causal constraints over 15 iterations in 533 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 154/154 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 23:09:41] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 23:09:41] [INFO ] Invariant cache hit.
[2024-06-02 23:09:41] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 23:09:41] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 23:09:41] [INFO ] Invariant cache hit.
[2024-06-02 23:09:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:09:41] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-06-02 23:09:41] [INFO ] Redundant transitions in 4 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 23:09:41] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 23:09:41] [INFO ] Invariant cache hit.
[2024-06-02 23:09:41] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:09:43] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:09:44] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:09:47] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:09:47] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:09:47] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:09:47] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:09:48] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:09:48] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:09:49] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:09:51] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 392/546 variables, 154/171 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 58/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:09:54] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:09:56] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:10:03] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:10:03] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 12 (OVERLAPS) 0/546 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 233 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (OVERLAPS) 392/546 variables, 154/175 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 423/656 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:10:25] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 1/657 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 657 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 15/15 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60737 ms. Remains : 154/154 places, 429/429 transitions.
RANDOM walk for 40000 steps (1299 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (277 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (274 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 782392 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :0 out of 2
Probabilistic random walk after 782392 steps, saw 188934 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :0
[2024-06-02 23:10:45] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 23:10:45] [INFO ] Invariant cache hit.
[2024-06-02 23:10:45] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/367 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/526 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/544 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/546 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/546 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/526 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/544 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/546 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 221 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 472ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 154/154 places, 429/429 transitions.
RANDOM walk for 40000 steps (1259 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (269 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (260 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 772066 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 2
Probabilistic random walk after 772066 steps, saw 186525 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
[2024-06-02 23:10:48] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 23:10:48] [INFO ] Invariant cache hit.
[2024-06-02 23:10:48] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/367 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/526 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/544 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/546 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/546 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 133/179 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/366 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/526 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/544 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/546 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 221 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 482ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 154/154 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 429/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 23:10:49] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 23:10:49] [INFO ] Invariant cache hit.
[2024-06-02 23:10:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:10:49] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 23:10:49] [INFO ] Invariant cache hit.
[2024-06-02 23:10:49] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:10:49] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-06-02 23:10:49] [INFO ] Redundant transitions in 3 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 23:10:49] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 23:10:49] [INFO ] Invariant cache hit.
[2024-06-02 23:10:49] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:10:51] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:10:52] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:10:55] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:10:55] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:10:55] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:10:55] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:10:56] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:10:56] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:10:57] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:10:59] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 392/546 variables, 154/171 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 58/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:11:04] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:11:11] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:11:11] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 12 (OVERLAPS) 0/546 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 233 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (OVERLAPS) 392/546 variables, 154/175 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 423/656 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:11:33] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 1/657 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 657 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 15/15 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60782 ms. Remains : 154/154 places, 429/429 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 154 vertex of which 29 / 154 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 128 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 128 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 127 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 127 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 126 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 125 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 125 transition count 230
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 125 transition count 215
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 116 transition count 212
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 116 transition count 212
Applied a total of 46 rules in 32 ms. Remains 116 /154 variables (removed 38) and now considering 212/429 (removed 217) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:11:50] [INFO ] Flow matrix only has 210 transitions (discarded 2 similar events)
// Phase 1: matrix 210 rows 116 cols
[2024-06-02 23:11:50] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:11:50] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:11:50] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:11:50] [INFO ] After 68ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-02 23:11:50] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 167 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-02 in 133001 ms.
Starting property specific reduction for FireWire-PT-13-UpperBounds-03
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:11:50] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 23:11:50] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (328 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (65 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:11:50] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:11:50] [INFO ] Invariant cache hit.
[2024-06-02 23:11:50] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:50] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 23:11:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:11:50] [INFO ] [Real]Added 61 Read/Feed constraints in 22 ms returned sat
[2024-06-02 23:11:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:11:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:50] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-02 23:11:50] [INFO ] [Nat]Added 61 Read/Feed constraints in 33 ms returned sat
[2024-06-02 23:11:50] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 25 ms.
[2024-06-02 23:11:50] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:11:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-02 23:11:50] [INFO ] Added : 22 causal constraints over 5 iterations in 234 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p92) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 456/456 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 164 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 164 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 162 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 160 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 160 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 159 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 159 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 158 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 158 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 157 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 157 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 156 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 156 transition count 434
Applied a total of 20 rules in 26 ms. Remains 156 /166 variables (removed 10) and now considering 434/456 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 156/166 places, 434/456 transitions.
[2024-06-02 23:11:51] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
// Phase 1: matrix 397 rows 156 cols
[2024-06-02 23:11:51] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (31822 resets) in 1539 ms. (649 steps per ms)
BEST_FIRST walk for 1000001 steps (6922 resets) in 494 ms. (2020 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:11:53] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 23:11:53] [INFO ] Invariant cache hit.
[2024-06-02 23:11:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:11:53] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:11:53] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:11:53] [INFO ] [Real]Added 59 Read/Feed constraints in 18 ms returned sat
[2024-06-02 23:11:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:11:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:53] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:11:53] [INFO ] [Nat]Added 59 Read/Feed constraints in 16 ms returned sat
[2024-06-02 23:11:53] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:11:53] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:11:53] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:11:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2024-06-02 23:11:53] [INFO ] Computed and/alt/rep : 164/596/164 causal constraints (skipped 227 transitions) in 24 ms.
[2024-06-02 23:11:53] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-06-02 23:11:53] [INFO ] Added : 32 causal constraints over 7 iterations in 263 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-06-02 23:11:54] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 23:11:54] [INFO ] Invariant cache hit.
[2024-06-02 23:11:54] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:11:54] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 23:11:54] [INFO ] Invariant cache hit.
[2024-06-02 23:11:54] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:11:54] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-02 23:11:54] [INFO ] Redundant transitions in 2 ms returned []
Running 428 sub problems to find dead transitions.
[2024-06-02 23:11:54] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 23:11:54] [INFO ] Invariant cache hit.
[2024-06-02 23:11:54] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:11:56] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:11:56] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:12:00] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:12:00] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:12:00] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:12:01] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:12:01] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:12:02] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:12:02] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/553 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 234 constraints, problems are : Problem set: 0 solved, 428 unsolved in 24972 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/175 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 428/662 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:12:40] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/553 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 663 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 13/13 constraints]
After SMT, in 55329ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 55333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55720 ms. Remains : 156/156 places, 434/434 transitions.
RANDOM walk for 40000 steps (1296 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (273 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (262 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 700194 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 2
Probabilistic random walk after 700194 steps, saw 173890 distinct states, run finished after 3002 ms. (steps per millisecond=233 ) properties seen :0
[2024-06-02 23:12:53] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 23:12:53] [INFO ] Invariant cache hit.
[2024-06-02 23:12:53] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/374 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/533 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/551 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/553 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/374 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/533 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/551 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/553 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 434/434 transitions.
RANDOM walk for 40000 steps (1268 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (262 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (285 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 706677 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 2
Probabilistic random walk after 706677 steps, saw 175525 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
[2024-06-02 23:12:56] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 23:12:56] [INFO ] Invariant cache hit.
[2024-06-02 23:12:56] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/374 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/533 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/551 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/553 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/186 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/373 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/374 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/533 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/551 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/553 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 514ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 434/434 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-06-02 23:12:57] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 23:12:57] [INFO ] Invariant cache hit.
[2024-06-02 23:12:57] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:12:57] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 23:12:57] [INFO ] Invariant cache hit.
[2024-06-02 23:12:57] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:12:57] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-02 23:12:57] [INFO ] Redundant transitions in 3 ms returned []
Running 428 sub problems to find dead transitions.
[2024-06-02 23:12:57] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 23:12:57] [INFO ] Invariant cache hit.
[2024-06-02 23:12:57] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:12:59] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:12:59] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:13:03] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:13:03] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:13:03] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 23:13:04] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:13:04] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:13:05] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:13:05] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:13:12] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:13:12] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:13:13] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/553 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 234 constraints, problems are : Problem set: 0 solved, 428 unsolved in 25138 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 397/553 variables, 156/175 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 428/662 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:13:43] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/553 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 663 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 13/13 constraints]
After SMT, in 55498ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 55504ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55864 ms. Remains : 156/156 places, 434/434 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 156 vertex of which 29 / 156 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 130 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 129 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 128 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 127 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 127 transition count 234
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 127 transition count 219
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 118 transition count 216
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 118 transition count 216
Applied a total of 46 rules in 30 ms. Remains 118 /156 variables (removed 38) and now considering 216/434 (removed 218) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:13:53] [INFO ] Flow matrix only has 214 transitions (discarded 2 similar events)
// Phase 1: matrix 214 rows 118 cols
[2024-06-02 23:13:53] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:13:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:13:53] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:13:53] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 23:13:53] [INFO ] After 146ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:13:53] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:13:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:13:53] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:13:53] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:13:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 1
[2024-06-02 23:13:53] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:13:53] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 473 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-03 in 123206 ms.
Starting property specific reduction for FireWire-PT-13-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:13:53] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 23:13:53] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (327 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10000 steps (72 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:13:53] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:13:53] [INFO ] Invariant cache hit.
[2024-06-02 23:13:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:13:53] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 23:13:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:13:53] [INFO ] [Real]Added 61 Read/Feed constraints in 17 ms returned sat
[2024-06-02 23:13:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:13:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:13:53] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 23:13:53] [INFO ] [Nat]Added 61 Read/Feed constraints in 26 ms returned sat
[2024-06-02 23:13:53] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 23:13:54] [INFO ] Added : 20 causal constraints over 4 iterations in 128 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p32) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 456/456 transitions.
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 165 transition count 453
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 451
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 162 transition count 447
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 162 transition count 447
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 160 transition count 442
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 160 transition count 442
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 158 transition count 438
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 158 transition count 438
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 157 transition count 435
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 157 transition count 435
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 156 transition count 433
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 156 transition count 433
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 155 transition count 430
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 155 transition count 430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 154 transition count 428
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 154 transition count 428
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 153 transition count 426
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 153 transition count 426
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 152 transition count 424
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 152 transition count 424
Applied a total of 26 rules in 26 ms. Remains 152 /166 variables (removed 14) and now considering 424/456 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 152/166 places, 424/456 transitions.
[2024-06-02 23:13:54] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
// Phase 1: matrix 387 rows 152 cols
[2024-06-02 23:13:54] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (31962 resets) in 1425 ms. (701 steps per ms)
BEST_FIRST walk for 1000001 steps (6938 resets) in 453 ms. (2202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:13:56] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 23:13:56] [INFO ] Invariant cache hit.
[2024-06-02 23:13:56] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:13:56] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-02 23:13:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 23:13:56] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-06-02 23:13:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:13:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:13:56] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 23:13:56] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2024-06-02 23:13:56] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:13:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-02 23:13:56] [INFO ] Computed and/alt/rep : 160/584/160 causal constraints (skipped 221 transitions) in 27 ms.
[2024-06-02 23:13:56] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:13:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-06-02 23:13:56] [INFO ] Added : 32 causal constraints over 7 iterations in 307 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 152/152 places, 424/424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 23:13:56] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 23:13:56] [INFO ] Invariant cache hit.
[2024-06-02 23:13:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:13:56] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 23:13:56] [INFO ] Invariant cache hit.
[2024-06-02 23:13:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 23:13:57] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-06-02 23:13:57] [INFO ] Redundant transitions in 4 ms returned []
Running 418 sub problems to find dead transitions.
[2024-06-02 23:13:57] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 23:13:57] [INFO ] Invariant cache hit.
[2024-06-02 23:13:57] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 23:13:58] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:13:59] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 23:14:02] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:14:02] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:14:03] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:14:03] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:14:03] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:14:03] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:14:03] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:14:04] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:14:04] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (OVERLAPS) 387/539 variables, 152/170 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 57/227 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 23:14:09] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:14:09] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:14:10] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:14:11] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:14:12] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 10 (OVERLAPS) 0/539 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 232 constraints, problems are : Problem set: 0 solved, 418 unsolved in 24392 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (OVERLAPS) 387/539 variables, 152/175 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 418/650 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 23:14:33] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/539 variables, and 651 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 17/17 constraints]
After SMT, in 54740ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 54746ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55095 ms. Remains : 152/152 places, 424/424 transitions.
RANDOM walk for 40000 steps (1300 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (280 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (283 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 779621 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 2
Probabilistic random walk after 779621 steps, saw 188004 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2024-06-02 23:14:55] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 23:14:55] [INFO ] Invariant cache hit.
[2024-06-02 23:14:55] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/359 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/360 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/519 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/537 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/539 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/539 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/359 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/519 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 38/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/537 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/539 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 424/424 transitions.
RANDOM walk for 40000 steps (1278 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (273 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (238 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 718658 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 2
Probabilistic random walk after 718658 steps, saw 178129 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
[2024-06-02 23:14:58] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 23:14:58] [INFO ] Invariant cache hit.
[2024-06-02 23:14:58] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/359 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/360 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/519 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/537 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/539 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/539 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/359 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/519 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 38/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/537 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/539 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 152/152 places, 424/424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 23:14:59] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 23:14:59] [INFO ] Invariant cache hit.
[2024-06-02 23:14:59] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 23:14:59] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 23:14:59] [INFO ] Invariant cache hit.
[2024-06-02 23:14:59] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 23:14:59] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-02 23:14:59] [INFO ] Redundant transitions in 4 ms returned []
Running 418 sub problems to find dead transitions.
[2024-06-02 23:14:59] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 23:14:59] [INFO ] Invariant cache hit.
[2024-06-02 23:14:59] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 23:15:01] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:15:02] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 23:15:05] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:15:05] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:15:05] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:15:05] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:15:05] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:15:06] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:15:06] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:15:06] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:15:07] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (OVERLAPS) 387/539 variables, 152/170 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 57/227 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 23:15:11] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:15:12] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:15:13] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:15:13] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:15:14] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 10 (OVERLAPS) 0/539 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 232 constraints, problems are : Problem set: 0 solved, 418 unsolved in 24704 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (OVERLAPS) 387/539 variables, 152/175 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 418/650 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 23:15:36] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/539 variables, and 651 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 17/17 constraints]
After SMT, in 55087ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 55094ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55474 ms. Remains : 152/152 places, 424/424 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 152 vertex of which 29 / 152 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 126 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 125 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 125 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 124 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 123 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 123 transition count 226
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 123 transition count 211
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 114 transition count 208
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 114 transition count 208
Applied a total of 46 rules in 19 ms. Remains 114 /152 variables (removed 38) and now considering 208/424 (removed 216) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:15:54] [INFO ] Flow matrix only has 206 transitions (discarded 2 similar events)
// Phase 1: matrix 206 rows 114 cols
[2024-06-02 23:15:54] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:15:54] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:15:54] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:15:54] [INFO ] After 86ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-02 23:15:54] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 168 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-08 in 121272 ms.
Starting property specific reduction for FireWire-PT-13-UpperBounds-15
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:15:54] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
// Phase 1: matrix 421 rows 166 cols
[2024-06-02 23:15:54] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (335 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (68 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:15:54] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2024-06-02 23:15:54] [INFO ] Invariant cache hit.
[2024-06-02 23:15:54] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:15:54] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:15:54] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:55] [INFO ] [Real]Added 61 Read/Feed constraints in 18 ms returned sat
[2024-06-02 23:15:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:15:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:15:55] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-02 23:15:55] [INFO ] [Nat]Added 61 Read/Feed constraints in 20 ms returned sat
[2024-06-02 23:15:55] [INFO ] Computed and/alt/rep : 170/626/170 causal constraints (skipped 245 transitions) in 24 ms.
[2024-06-02 23:15:55] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:15:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-06-02 23:15:55] [INFO ] Added : 21 causal constraints over 6 iterations in 291 ms. Result :sat
Minimization took 158 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 166 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p162) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 456/456 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 164 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 164 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 162 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 162 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 160 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 160 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 158 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 158 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 156 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 156 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 154 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 154 transition count 427
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 152 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 152 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 151 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 151 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 150 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 150 transition count 419
Applied a total of 32 rules in 20 ms. Remains 150 /166 variables (removed 16) and now considering 419/456 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 150/166 places, 419/456 transitions.
[2024-06-02 23:15:55] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
// Phase 1: matrix 382 rows 150 cols
[2024-06-02 23:15:55] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (31890 resets) in 1450 ms. (689 steps per ms)
BEST_FIRST walk for 1000001 steps (6871 resets) in 471 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:15:57] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 23:15:57] [INFO ] Invariant cache hit.
[2024-06-02 23:15:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:57] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 23:15:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:15:57] [INFO ] [Real]Added 56 Read/Feed constraints in 23 ms returned sat
[2024-06-02 23:15:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:15:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:57] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-02 23:15:57] [INFO ] [Nat]Added 56 Read/Feed constraints in 52 ms returned sat
[2024-06-02 23:15:57] [INFO ] Computed and/alt/rep : 158/578/158 causal constraints (skipped 218 transitions) in 21 ms.
[2024-06-02 23:15:58] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:15:58] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:15:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2024-06-02 23:15:58] [INFO ] Added : 43 causal constraints over 10 iterations in 437 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 150/150 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 23:15:58] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 23:15:58] [INFO ] Invariant cache hit.
[2024-06-02 23:15:58] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:15:58] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 23:15:58] [INFO ] Invariant cache hit.
[2024-06-02 23:15:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:15:58] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-02 23:15:58] [INFO ] Redundant transitions in 3 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-02 23:15:58] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 23:15:58] [INFO ] Invariant cache hit.
[2024-06-02 23:15:58] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:16:01] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:16:04] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:16:04] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:16:04] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:16:04] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 4 ms to minimize.
[2024-06-02 23:16:05] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (OVERLAPS) 382/532 variables, 150/167 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 56/223 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:16:19] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:16:19] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 12 (OVERLAPS) 0/532 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 226 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 382/532 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 413/639 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 10 (OVERLAPS) 0/532 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 639 constraints, problems are : Problem set: 0 solved, 413 unsolved in 28564 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 13/13 constraints]
After SMT, in 58958ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 58962ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59310 ms. Remains : 150/150 places, 419/419 transitions.
RANDOM walk for 40000 steps (1282 resets) in 286 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (285 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (288 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 721673 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 2
Probabilistic random walk after 721673 steps, saw 178694 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2024-06-02 23:17:00] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 23:17:00] [INFO ] Invariant cache hit.
[2024-06-02 23:17:00] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/353 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/512 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/530 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/512 variables, 79/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 38/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/530 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/532 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 150/150 places, 419/419 transitions.
RANDOM walk for 40000 steps (1291 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (275 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (291 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 783702 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 2
Probabilistic random walk after 783702 steps, saw 189256 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
[2024-06-02 23:17:04] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 23:17:04] [INFO ] Invariant cache hit.
[2024-06-02 23:17:04] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/353 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/512 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/530 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/165 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/352 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/512 variables, 79/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 38/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/530 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/532 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 448ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 150/150 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 419/419 transitions.
Applied a total of 0 rules in 11 ms. Remains 150 /150 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 23:17:05] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 23:17:05] [INFO ] Invariant cache hit.
[2024-06-02 23:17:05] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:17:05] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 23:17:05] [INFO ] Invariant cache hit.
[2024-06-02 23:17:05] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:17:05] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-02 23:17:05] [INFO ] Redundant transitions in 3 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-02 23:17:05] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 23:17:05] [INFO ] Invariant cache hit.
[2024-06-02 23:17:05] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:17:07] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:17:07] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:17:11] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:17:11] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:17:11] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:17:11] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:17:11] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:17:12] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:17:14] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:17:14] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (OVERLAPS) 382/532 variables, 150/167 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 56/223 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:17:18] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 23:17:26] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:17:26] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 12 (OVERLAPS) 0/532 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 226 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 382/532 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 413/639 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 10 (OVERLAPS) 0/532 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 639 constraints, problems are : Problem set: 0 solved, 413 unsolved in 27990 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 13/13 constraints]
After SMT, in 58303ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 58309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58681 ms. Remains : 150/150 places, 419/419 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 150 vertex of which 29 / 150 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 124 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 123 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 122 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 121 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 121 transition count 222
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 121 transition count 207
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 112 transition count 204
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 112 transition count 204
Applied a total of 46 rules in 21 ms. Remains 112 /150 variables (removed 38) and now considering 204/419 (removed 215) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:18:03] [INFO ] Flow matrix only has 202 transitions (discarded 2 similar events)
// Phase 1: matrix 202 rows 112 cols
[2024-06-02 23:18:03] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:18:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:18:03] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:18:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 23:18:03] [INFO ] After 126ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:18:03] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:18:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:18:04] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:18:04] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:18:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2024-06-02 23:18:04] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:18:04] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 376 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-13-UpperBounds-15 in 129314 ms.
[2024-06-02 23:18:04] [INFO ] Flatten gal took : 67 ms
[2024-06-02 23:18:04] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-02 23:18:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 166 places, 458 transitions and 1725 arcs took 6 ms.
Total runtime 805994 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-13
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 166
TRANSITIONS: 458
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 1885
MODEL NAME: /home/mcc/execution/413/model
166 places, 458 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.
Building monolithic NSF...
FORMULA FireWire-PT-13-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-13-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-13-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-13-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-13-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717370289196
--------------------
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="FireWire-PT-13"
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 FireWire-PT-13, 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 r549-tall-171734898200269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 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 ;