About the Execution of GreatSPN+red for DoubleLock-PT-p3s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14315.771 | 3600000.00 | 10537452.00 | 5928.20 | 10 ? ? 1 1 1 1 1 inf 0 1 1 1 ? inf 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.r135-tall-171631131500637.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 DoubleLock-PT-p3s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500637
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 330K May 18 16:42 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 DoubleLock-PT-p3s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p3s2-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716398509201
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:21:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 17:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:21:50] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-22 17:21:50] [INFO ] Transformed 112 places.
[2024-05-22 17:21:50] [INFO ] Transformed 744 transitions.
[2024-05-22 17:21:50] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 32 transitions.
FORMULA DoubleLock-PT-p3s2-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 17:21:50] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 92 cols
[2024-05-22 17:21:50] [INFO ] Computed 4 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, +inf, +inf, 1, 1, 1, 1, 1, +inf, 1, 1, 1, +inf, 1]
RANDOM walk for 10000 steps (118 resets) in 35 ms. (277 steps per ms)
FORMULA DoubleLock-PT-p3s2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (91 resets) in 49 ms. (800 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 9, 2] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:21:50] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:21:50] [INFO ] Invariant cache hit.
[2024-05-22 17:21:50] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-22 17:21:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:21:51] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-22 17:21:51] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 17:21:51] [INFO ] [Real]Added 47 Read/Feed constraints in 11 ms returned sat
[2024-05-22 17:21:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:21:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:21:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:21:51] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-22 17:21:51] [INFO ] [Nat]Added 47 Read/Feed constraints in 29 ms returned sat
[2024-05-22 17:21:51] [INFO ] Computed and/alt/rep : 67/387/67 causal constraints (skipped 446 transitions) in 122 ms.
[2024-05-22 17:21:51] [INFO ] Added : 3 causal constraints over 1 iterations in 218 ms. Result :sat
Minimization took 296 ms.
[2024-05-22 17:21:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:21:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:21:52] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-22 17:21:52] [INFO ] [Real]Added 47 Read/Feed constraints in 13 ms returned sat
[2024-05-22 17:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:21:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:21:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:21:52] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-22 17:21:52] [INFO ] [Nat]Added 47 Read/Feed constraints in 18 ms returned sat
[2024-05-22 17:21:52] [INFO ] Computed and/alt/rep : 67/387/67 causal constraints (skipped 446 transitions) in 69 ms.
[2024-05-22 17:21:52] [INFO ] Added : 10 causal constraints over 3 iterations in 210 ms. Result :sat
Minimization took 349 ms.
[2024-05-22 17:21:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:21:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:21:53] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-22 17:21:53] [INFO ] [Real]Added 47 Read/Feed constraints in 45 ms returned sat
[2024-05-22 17:21:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:21:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 17:21:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:21:53] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-22 17:21:53] [INFO ] [Nat]Added 47 Read/Feed constraints in 44 ms returned sat
[2024-05-22 17:21:53] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 13 ms to minimize.
[2024-05-22 17:21:53] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 2 ms to minimize.
[2024-05-22 17:21:53] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-05-22 17:21:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 559 ms
[2024-05-22 17:21:53] [INFO ] Computed and/alt/rep : 67/387/67 causal constraints (skipped 446 transitions) in 43 ms.
[2024-05-22 17:21:54] [INFO ] Added : 0 causal constraints over 0 iterations in 99 ms. Result :sat
Minimization took 243 ms.
[2024-05-22 17:21:54] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 17:21:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-22 17:21:54] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-22 17:21:54] [INFO ] [Real]Added 47 Read/Feed constraints in 16 ms returned sat
[2024-05-22 17:21:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:21:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:21:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:21:54] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-22 17:21:54] [INFO ] [Nat]Added 47 Read/Feed constraints in 22 ms returned sat
[2024-05-22 17:21:54] [INFO ] Computed and/alt/rep : 67/387/67 causal constraints (skipped 446 transitions) in 44 ms.
[2024-05-22 17:21:54] [INFO ] Added : 2 causal constraints over 1 iterations in 106 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 9, 2] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 1, 10, 2] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 712/712 transitions.
Graph (complete) has 1229 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 112 ms. Remains 90 /92 variables (removed 2) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 90/92 places, 712/712 transitions.
[2024-05-22 17:21:55] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
Found an invariant !
This invariant on transitions {10=1, 15=1, 28=1, 302=1, 513=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {15=1, 28=1, 298=1, 509=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 180 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :[1, 1, 6, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 1, 10, 2] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:21:55] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 90 cols
[2024-05-22 17:21:55] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15, 1, 10, 2] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (11736 resets) in 869 ms. (1149 steps per ms)
BEST_FIRST walk for 4000001 steps (9221 resets) in 1673 ms. (2389 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 2, 14, 5] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:21:58] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:21:58] [INFO ] Invariant cache hit.
[2024-05-22 17:21:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:21:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:21:58] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-22 17:21:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:21:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:21:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:21:58] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-22 17:21:58] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 17:21:58] [INFO ] [Nat]Added 47 Read/Feed constraints in 31 ms returned sat
[2024-05-22 17:21:58] [INFO ] Computed and/alt/rep : 67/387/67 causal constraints (skipped 446 transitions) in 35 ms.
[2024-05-22 17:21:58] [INFO ] Added : 8 causal constraints over 2 iterations in 123 ms. Result :sat
Minimization took 331 ms.
[2024-05-22 17:21:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:21:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-22 17:21:59] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-22 17:21:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:21:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:21:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:21:59] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-22 17:21:59] [INFO ] [Nat]Added 47 Read/Feed constraints in 29 ms returned sat
[2024-05-22 17:21:59] [INFO ] Computed and/alt/rep : 67/387/67 causal constraints (skipped 446 transitions) in 40 ms.
[2024-05-22 17:21:59] [INFO ] Added : 11 causal constraints over 3 iterations in 164 ms. Result :sat
Minimization took 421 ms.
[2024-05-22 17:22:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:22:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:22:00] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-22 17:22:00] [INFO ] [Real]Added 47 Read/Feed constraints in 19 ms returned sat
[2024-05-22 17:22:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:22:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:22:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:22:00] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-22 17:22:00] [INFO ] [Nat]Added 47 Read/Feed constraints in 20 ms returned sat
[2024-05-22 17:22:00] [INFO ] Computed and/alt/rep : 67/387/67 causal constraints (skipped 446 transitions) in 34 ms.
[2024-05-22 17:22:00] [INFO ] Added : 2 causal constraints over 2 iterations in 125 ms. Result :sat
Minimization took 317 ms.
[2024-05-22 17:22:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:22:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:22:00] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-22 17:22:00] [INFO ] [Real]Added 47 Read/Feed constraints in 18 ms returned sat
[2024-05-22 17:22:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:22:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:22:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-22 17:22:01] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-22 17:22:01] [INFO ] [Nat]Added 47 Read/Feed constraints in 23 ms returned sat
[2024-05-22 17:22:01] [INFO ] Computed and/alt/rep : 67/387/67 causal constraints (skipped 446 transitions) in 33 ms.
[2024-05-22 17:22:01] [INFO ] Added : 2 causal constraints over 1 iterations in 90 ms. Result :sat
Minimization took 401 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 2, 14, 5] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 2, 14, 5] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 712/712 transitions.
Applied a total of 0 rules in 17 ms. Remains 90 /90 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 90/90 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 712/712 transitions.
Applied a total of 0 rules in 17 ms. Remains 90 /90 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2024-05-22 17:22:01] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:22:01] [INFO ] Invariant cache hit.
[2024-05-22 17:22:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-22 17:22:02] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:22:02] [INFO ] Invariant cache hit.
[2024-05-22 17:22:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 17:22:02] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-22 17:22:02] [INFO ] Redundant transitions in 35 ms returned []
Running 710 sub problems to find dead transitions.
[2024-05-22 17:22:02] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:22:02] [INFO ] Invariant cache hit.
[2024-05-22 17:22:02] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/605 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 8 (OVERLAPS) 0/605 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 139 constraints, problems are : Problem set: 0 solved, 710 unsolved in 22941 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 32/170 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 7 (OVERLAPS) 1/605 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 678/849 constraints. Problems are: Problem set: 144 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/605 variables, and 849 constraints, problems are : Problem set: 144 solved, 566 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
After SMT, in 53713ms problems are : Problem set: 144 solved, 566 unsolved
Search for dead transitions found 144 dead transitions in 53731ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/90 places, 568/712 transitions.
Graph (complete) has 971 edges and 90 vertex of which 82 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 82 /90 variables (removed 8) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:22:56] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 82 cols
[2024-05-22 17:22:56] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 17:22:56] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 17:22:56] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:22:56] [INFO ] Invariant cache hit.
[2024-05-22 17:22:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:22:56] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/90 places, 568/712 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54517 ms. Remains : 82/90 places, 568/712 transitions.
[2024-05-22 17:22:56] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {15=1, 28=1, 302=1, 387=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {15=1, 28=1, 302=1, 388=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 177 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :[1, 1, 5, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 2, 14, 5] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:22:56] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:22:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15, 2, 14, 5] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000003 steps (11740 resets) in 741 ms. (1347 steps per ms)
BEST_FIRST walk for 4000003 steps (9250 resets) in 1548 ms. (2582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 2, 15, 5] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:22:58] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:22:58] [INFO ] Invariant cache hit.
[2024-05-22 17:22:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:22:59] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-22 17:22:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:22:59] [INFO ] [Real]Added 41 Read/Feed constraints in 40 ms returned sat
[2024-05-22 17:22:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:22:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:22:59] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-22 17:22:59] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-05-22 17:22:59] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 27 ms.
[2024-05-22 17:22:59] [INFO ] Added : 4 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 134 ms.
[2024-05-22 17:22:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:22:59] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 17:22:59] [INFO ] [Real]Added 41 Read/Feed constraints in 11 ms returned sat
[2024-05-22 17:22:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:22:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:22:59] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 17:22:59] [INFO ] [Nat]Added 41 Read/Feed constraints in 10 ms returned sat
[2024-05-22 17:22:59] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 25 ms.
[2024-05-22 17:22:59] [INFO ] Added : 3 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 157 ms.
[2024-05-22 17:22:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:00] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 17:23:00] [INFO ] [Real]Added 41 Read/Feed constraints in 16 ms returned sat
[2024-05-22 17:23:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:00] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-22 17:23:00] [INFO ] [Nat]Added 41 Read/Feed constraints in 17 ms returned sat
[2024-05-22 17:23:00] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 29 ms.
[2024-05-22 17:23:00] [INFO ] Added : 2 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 118 ms.
[2024-05-22 17:23:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:00] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-22 17:23:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:00] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-22 17:23:00] [INFO ] [Nat]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-05-22 17:23:00] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 22 ms.
[2024-05-22 17:23:00] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 2, 15, 5] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 2, 15, 5] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 82/82 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:23:00] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:00] [INFO ] Invariant cache hit.
[2024-05-22 17:23:01] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 17:23:01] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:01] [INFO ] Invariant cache hit.
[2024-05-22 17:23:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:23:01] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-22 17:23:01] [INFO ] Redundant transitions in 4 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:23:01] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:01] [INFO ] Invariant cache hit.
[2024-05-22 17:23:01] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 1/471 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 124 constraints, problems are : Problem set: 0 solved, 566 unsolved in 19808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 566 unsolved
SMT process timed out in 50238ms, After SMT, problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 50244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50554 ms. Remains : 82/82 places, 568/568 transitions.
[2024-05-22 17:23:51] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {15=1, 28=1, 302=1, 387=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {15=1, 28=1, 302=1, 388=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 179 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :[2, 2, 5, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 2, 15, 5] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:23:51] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15, 2, 15, 5] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (11710 resets) in 790 ms. (1264 steps per ms)
BEST_FIRST walk for 4000003 steps (9202 resets) in 1647 ms. (2427 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 2, 16, 5] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:23:54] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:54] [INFO ] Invariant cache hit.
[2024-05-22 17:23:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:54] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 17:23:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:23:54] [INFO ] [Real]Added 41 Read/Feed constraints in 43 ms returned sat
[2024-05-22 17:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:54] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-22 17:23:54] [INFO ] [Nat]Added 41 Read/Feed constraints in 20 ms returned sat
[2024-05-22 17:23:54] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 25 ms.
[2024-05-22 17:23:54] [INFO ] Added : 4 causal constraints over 2 iterations in 74 ms. Result :sat
Minimization took 135 ms.
[2024-05-22 17:23:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:54] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-22 17:23:54] [INFO ] [Real]Added 41 Read/Feed constraints in 11 ms returned sat
[2024-05-22 17:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:54] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 17:23:54] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-05-22 17:23:54] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 23 ms.
[2024-05-22 17:23:54] [INFO ] Added : 3 causal constraints over 2 iterations in 79 ms. Result :sat
Minimization took 153 ms.
[2024-05-22 17:23:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:55] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-22 17:23:55] [INFO ] [Real]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-05-22 17:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:55] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 17:23:55] [INFO ] [Nat]Added 41 Read/Feed constraints in 17 ms returned sat
[2024-05-22 17:23:55] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 24 ms.
[2024-05-22 17:23:55] [INFO ] Added : 2 causal constraints over 2 iterations in 81 ms. Result :sat
Minimization took 121 ms.
[2024-05-22 17:23:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:55] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-22 17:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:23:55] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-22 17:23:55] [INFO ] [Nat]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-05-22 17:23:55] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 23 ms.
[2024-05-22 17:23:55] [INFO ] Added : 0 causal constraints over 0 iterations in 46 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 2, 16, 5] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 2, 16, 5] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 19 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 82/82 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 24 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:23:56] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:56] [INFO ] Invariant cache hit.
[2024-05-22 17:23:56] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 17:23:56] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:56] [INFO ] Invariant cache hit.
[2024-05-22 17:23:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:23:56] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-22 17:23:56] [INFO ] Redundant transitions in 5 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:23:56] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:56] [INFO ] Invariant cache hit.
[2024-05-22 17:23:56] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 1/471 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 124 constraints, problems are : Problem set: 0 solved, 566 unsolved in 19667 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/471 variables, and 537 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 414/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 50150ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 50158ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50483 ms. Remains : 82/82 places, 568/568 transitions.
[2024-05-22 17:24:46] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {15=1, 28=1, 302=1, 387=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {15=1, 28=1, 302=1, 388=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 190 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :[1, 1, 6, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 2, 16, 5] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:24:46] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:24:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15, 2, 16, 5] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (11740 resets) in 763 ms. (1308 steps per ms)
BEST_FIRST walk for 4000004 steps (9238 resets) in 1661 ms. (2406 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 2, 19, 5] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:24:49] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:24:49] [INFO ] Invariant cache hit.
[2024-05-22 17:24:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:24:49] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-22 17:24:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:24:49] [INFO ] [Real]Added 41 Read/Feed constraints in 42 ms returned sat
[2024-05-22 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:24:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:24:49] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-22 17:24:49] [INFO ] [Nat]Added 41 Read/Feed constraints in 23 ms returned sat
[2024-05-22 17:24:49] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 29 ms.
[2024-05-22 17:24:49] [INFO ] Added : 4 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 143 ms.
[2024-05-22 17:24:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:24:49] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 17:24:49] [INFO ] [Real]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-05-22 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:24:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:24:49] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-22 17:24:49] [INFO ] [Nat]Added 41 Read/Feed constraints in 14 ms returned sat
[2024-05-22 17:24:50] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 24 ms.
[2024-05-22 17:24:50] [INFO ] Added : 3 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 155 ms.
[2024-05-22 17:24:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:24:50] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 17:24:50] [INFO ] [Real]Added 41 Read/Feed constraints in 14 ms returned sat
[2024-05-22 17:24:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:24:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:24:50] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-22 17:24:50] [INFO ] [Nat]Added 41 Read/Feed constraints in 17 ms returned sat
[2024-05-22 17:24:50] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 25 ms.
[2024-05-22 17:24:50] [INFO ] Added : 2 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 125 ms.
[2024-05-22 17:24:50] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:24:50] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-22 17:24:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:24:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:24:50] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 17:24:50] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-05-22 17:24:50] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 24 ms.
[2024-05-22 17:24:50] [INFO ] Added : 0 causal constraints over 0 iterations in 60 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 2, 19, 5] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 2, 19, 5] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 82/82 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:24:51] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:24:51] [INFO ] Invariant cache hit.
[2024-05-22 17:24:51] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 17:24:51] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:24:51] [INFO ] Invariant cache hit.
[2024-05-22 17:24:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:24:51] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-22 17:24:51] [INFO ] Redundant transitions in 5 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:24:51] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:24:51] [INFO ] Invariant cache hit.
[2024-05-22 17:24:51] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 1/471 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 124 constraints, problems are : Problem set: 0 solved, 566 unsolved in 20502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 1/471 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 690 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 50979ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 50986ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51306 ms. Remains : 82/82 places, 568/568 transitions.
[2024-05-22 17:25:42] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {15=1, 28=1, 302=1, 387=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {15=1, 28=1, 302=1, 388=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 186 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :[0, 1, 2147483647, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 2, +inf, 5] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-22 17:25:42] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:25:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19, 2, +inf, 5] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (11765 resets) in 767 ms. (1302 steps per ms)
FORMULA DoubleLock-PT-p3s2-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s2-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 3000003 steps (7344 resets) in 1218 ms. (2461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:25:44] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:25:44] [INFO ] Invariant cache hit.
[2024-05-22 17:25:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:44] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 17:25:44] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:25:44] [INFO ] [Real]Added 41 Read/Feed constraints in 34 ms returned sat
[2024-05-22 17:25:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:25:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:45] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 17:25:45] [INFO ] [Nat]Added 41 Read/Feed constraints in 21 ms returned sat
[2024-05-22 17:25:45] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 23 ms.
[2024-05-22 17:25:45] [INFO ] Added : 4 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 132 ms.
[2024-05-22 17:25:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:45] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-22 17:25:45] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-05-22 17:25:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:25:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:45] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-22 17:25:45] [INFO ] [Nat]Added 41 Read/Feed constraints in 10 ms returned sat
[2024-05-22 17:25:45] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 24 ms.
[2024-05-22 17:25:45] [INFO ] Added : 3 causal constraints over 2 iterations in 75 ms. Result :sat
Minimization took 168 ms.
[2024-05-22 17:25:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:45] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-22 17:25:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:25:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:45] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-22 17:25:45] [INFO ] [Nat]Added 41 Read/Feed constraints in 21 ms returned sat
[2024-05-22 17:25:46] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 25 ms.
[2024-05-22 17:25:46] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Minimization took 199 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 82/82 places, 568/568 transitions.
[2024-05-22 17:25:46] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {15=1, 28=1, 302=1, 387=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {15=1, 28=1, 302=1, 388=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 186 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :[0, 1, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:25:46] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:25:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000002 steps (11686 resets) in 761 ms. (1312 steps per ms)
BEST_FIRST walk for 3000003 steps (7344 resets) in 1264 ms. (2371 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:25:48] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:25:48] [INFO ] Invariant cache hit.
[2024-05-22 17:25:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:48] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-22 17:25:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:25:48] [INFO ] [Real]Added 41 Read/Feed constraints in 34 ms returned sat
[2024-05-22 17:25:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:25:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:48] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 17:25:48] [INFO ] [Nat]Added 41 Read/Feed constraints in 20 ms returned sat
[2024-05-22 17:25:48] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 23 ms.
[2024-05-22 17:25:48] [INFO ] Added : 4 causal constraints over 2 iterations in 75 ms. Result :sat
Minimization took 132 ms.
[2024-05-22 17:25:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:49] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-22 17:25:49] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-05-22 17:25:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:25:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:49] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-22 17:25:49] [INFO ] [Nat]Added 41 Read/Feed constraints in 10 ms returned sat
[2024-05-22 17:25:49] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 23 ms.
[2024-05-22 17:25:49] [INFO ] Added : 3 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 160 ms.
[2024-05-22 17:25:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:49] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-22 17:25:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:25:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:25:49] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-22 17:25:49] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-05-22 17:25:49] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 21 ms.
[2024-05-22 17:25:49] [INFO ] Added : 0 causal constraints over 0 iterations in 46 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 14 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 82/82 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:25:49] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:25:49] [INFO ] Invariant cache hit.
[2024-05-22 17:25:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 17:25:49] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:25:49] [INFO ] Invariant cache hit.
[2024-05-22 17:25:50] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:25:50] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-22 17:25:50] [INFO ] Redundant transitions in 3 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:25:50] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:25:50] [INFO ] Invariant cache hit.
[2024-05-22 17:25:50] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 1/471 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 124 constraints, problems are : Problem set: 0 solved, 566 unsolved in 20099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/471 variables, and 537 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 414/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 50494ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 50499ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50805 ms. Remains : 82/82 places, 568/568 transitions.
[2024-05-22 17:26:40] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {15=1, 28=1, 302=1, 387=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {15=1, 28=1, 302=1, 388=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 186 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :[0, 1, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 40011 steps (471 resets) in 499 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (102 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (94 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (93 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 436431 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :1 out of 3
Probabilistic random walk after 436431 steps, saw 329833 distinct states, run finished after 3004 ms. (steps per millisecond=145 ) properties seen :1
[2024-05-22 17:26:44] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:26:44] [INFO ] Invariant cache hit.
[2024-05-22 17:26:44] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 361/397 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 74/471 variables, 56/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 124 constraints, problems are : Problem set: 0 solved, 2 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 361/397 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 74/471 variables, 56/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 40/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/471 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 199 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Graph (complete) has 915 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 81 /82 variables (removed 1) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 81/82 places, 568/568 transitions.
RANDOM walk for 40014 steps (469 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (101 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 359659 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 2
Probabilistic random walk after 359659 steps, saw 250995 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2024-05-22 17:26:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 81 cols
[2024-05-22 17:26:47] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 17:26:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 361/397 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 73/470 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 361/397 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 73/470 variables, 55/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/470 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 200 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 81/81 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:26:48] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:26:48] [INFO ] Invariant cache hit.
[2024-05-22 17:26:48] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 17:26:48] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:26:48] [INFO ] Invariant cache hit.
[2024-05-22 17:26:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:26:48] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-22 17:26:48] [INFO ] Redundant transitions in 4 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:26:48] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:26:48] [INFO ] Invariant cache hit.
[2024-05-22 17:26:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43631ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43637ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43935 ms. Remains : 81/81 places, 568/568 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 81 transition count 389
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 179 place count 81 transition count 381
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 195 place count 73 transition count 381
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 1 with 4 rules applied. Total rules applied 199 place count 71 transition count 379
Applied a total of 199 rules in 22 ms. Remains 71 /81 variables (removed 10) and now considering 379/568 (removed 189) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 379 rows 71 cols
[2024-05-22 17:27:32] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 17:27:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:27:32] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 17:27:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:27:32] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 17:27:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 17:27:32] [INFO ] After 20ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 17:27:32] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 17:27:32] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 314 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[19, 2, 5] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for DoubleLock-PT-p3s2-UpperBounds-01
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 17:27:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 82 cols
[2024-05-22 17:27:32] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (118 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (25 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-22 17:27:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:27:32] [INFO ] Invariant cache hit.
[2024-05-22 17:27:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:27:32] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-22 17:27:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:27:32] [INFO ] [Real]Added 41 Read/Feed constraints in 14 ms returned sat
[2024-05-22 17:27:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:27:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:27:33] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-22 17:27:33] [INFO ] [Nat]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-05-22 17:27:33] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 27 ms.
[2024-05-22 17:27:33] [INFO ] Added : 2 causal constraints over 1 iterations in 63 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 82 transition count 560
Applied a total of 8 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 560/568 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 82/82 places, 560/568 transitions.
[2024-05-22 17:27:33] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {14=1, 27=1, 282=1, 368=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {14=1, 27=1, 294=1, 380=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 186 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 17:27:33] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
// Phase 1: matrix 381 rows 82 cols
[2024-05-22 17:27:33] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000006 steps (11685 resets) in 720 ms. (1386 steps per ms)
BEST_FIRST walk for 1000001 steps (2472 resets) in 391 ms. (2551 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 17:27:34] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:27:34] [INFO ] Invariant cache hit.
[2024-05-22 17:27:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 17:27:34] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-22 17:27:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:27:34] [INFO ] [Real]Added 41 Read/Feed constraints in 22 ms returned sat
[2024-05-22 17:27:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:27:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 17:27:34] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-22 17:27:34] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-05-22 17:27:34] [INFO ] Computed and/alt/rep : 22/63/22 causal constraints (skipped 357 transitions) in 23 ms.
[2024-05-22 17:27:34] [INFO ] Added : 3 causal constraints over 2 iterations in 79 ms. Result :sat
Minimization took 199 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 560/560 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 560/560 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2024-05-22 17:27:35] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:27:35] [INFO ] Invariant cache hit.
[2024-05-22 17:27:35] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 17:27:35] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:27:35] [INFO ] Invariant cache hit.
[2024-05-22 17:27:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:27:35] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-22 17:27:35] [INFO ] Redundant transitions in 3 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-22 17:27:35] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:27:35] [INFO ] Invariant cache hit.
[2024-05-22 17:27:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 125 constraints, problems are : Problem set: 0 solved, 558 unsolved in 12873 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 408/532 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (OVERLAPS) 1/463 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 683 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
After SMT, in 43274ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 43280ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43608 ms. Remains : 82/82 places, 560/560 transitions.
[2024-05-22 17:28:18] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {14=1, 27=1, 282=1, 368=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {14=1, 27=1, 294=1, 380=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 175 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 40007 steps (471 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (91 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 594 steps, run visited all 1 properties in 5 ms. (steps per millisecond=118 )
Probabilistic random walk after 594 steps, saw 445 distinct states, run finished after 9 ms. (steps per millisecond=66 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p3s2-UpperBounds-01 in 46212 ms.
Starting property specific reduction for DoubleLock-PT-p3s2-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 17:28:18] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 82 cols
[2024-05-22 17:28:18] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (120 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (23 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-22 17:28:19] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:28:19] [INFO ] Invariant cache hit.
[2024-05-22 17:28:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:28:19] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-22 17:28:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:28:19] [INFO ] [Real]Added 41 Read/Feed constraints in 11 ms returned sat
[2024-05-22 17:28:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:28:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:28:19] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-22 17:28:19] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-05-22 17:28:19] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 24 ms.
[2024-05-22 17:28:19] [INFO ] Added : 4 causal constraints over 2 iterations in 71 ms. Result :sat
Minimization took 215 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Graph (complete) has 915 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 81 transition count 560
Applied a total of 9 rules in 7 ms. Remains 81 /82 variables (removed 1) and now considering 560/568 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 81/82 places, 560/568 transitions.
[2024-05-22 17:28:19] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {14=1, 27=1, 270=1, 356=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {14=1, 27=1, 278=1, 364=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 189 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-22 17:28:19] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
// Phase 1: matrix 381 rows 81 cols
[2024-05-22 17:28:19] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (11698 resets) in 719 ms. (1388 steps per ms)
BEST_FIRST walk for 1000000 steps (2466 resets) in 383 ms. (2604 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 17:28:20] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:28:20] [INFO ] Invariant cache hit.
[2024-05-22 17:28:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 17:28:20] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-22 17:28:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:28:20] [INFO ] [Real]Added 41 Read/Feed constraints in 14 ms returned sat
[2024-05-22 17:28:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:28:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 17:28:21] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-22 17:28:21] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2024-05-22 17:28:21] [INFO ] Computed and/alt/rep : 22/63/22 causal constraints (skipped 357 transitions) in 22 ms.
[2024-05-22 17:28:21] [INFO ] Added : 2 causal constraints over 1 iterations in 61 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 560/560 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 81/81 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 560/560 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2024-05-22 17:28:21] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:28:21] [INFO ] Invariant cache hit.
[2024-05-22 17:28:21] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 17:28:21] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:28:21] [INFO ] Invariant cache hit.
[2024-05-22 17:28:21] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:28:21] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-22 17:28:21] [INFO ] Redundant transitions in 5 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-22 17:28:21] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:28:21] [INFO ] Invariant cache hit.
[2024-05-22 17:28:21] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (OVERLAPS) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 124 constraints, problems are : Problem set: 0 solved, 558 unsolved in 9821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 558/682 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 682 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
After SMT, in 40234ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 40239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40533 ms. Remains : 81/81 places, 560/560 transitions.
[2024-05-22 17:29:01] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {14=1, 27=1, 270=1, 356=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {14=1, 27=1, 278=1, 364=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 172 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 17:29:02] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (11751 resets) in 736 ms. (1356 steps per ms)
BEST_FIRST walk for 1000001 steps (2438 resets) in 394 ms. (2531 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 17:29:03] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:03] [INFO ] Invariant cache hit.
[2024-05-22 17:29:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 17:29:03] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-22 17:29:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:29:03] [INFO ] [Real]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-05-22 17:29:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:29:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 17:29:03] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-22 17:29:03] [INFO ] [Nat]Added 41 Read/Feed constraints in 7 ms returned sat
[2024-05-22 17:29:03] [INFO ] Computed and/alt/rep : 22/63/22 causal constraints (skipped 357 transitions) in 24 ms.
[2024-05-22 17:29:03] [INFO ] Added : 2 causal constraints over 1 iterations in 64 ms. Result :sat
Minimization took 209 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 560/560 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 81/81 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 560/560 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2024-05-22 17:29:03] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:03] [INFO ] Invariant cache hit.
[2024-05-22 17:29:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 17:29:03] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:03] [INFO ] Invariant cache hit.
[2024-05-22 17:29:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:29:04] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-22 17:29:04] [INFO ] Redundant transitions in 4 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-22 17:29:04] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:04] [INFO ] Invariant cache hit.
[2024-05-22 17:29:04] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (OVERLAPS) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 124 constraints, problems are : Problem set: 0 solved, 558 unsolved in 10060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 558/682 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 682 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
After SMT, in 40461ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 40466ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40759 ms. Remains : 81/81 places, 560/560 transitions.
[2024-05-22 17:29:44] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {14=1, 27=1, 270=1, 356=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {14=1, 27=1, 278=1, 364=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 187 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40006 steps (472 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (100 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1199023 steps, run timeout after 3001 ms. (steps per millisecond=399 ) properties seen :0 out of 1
Probabilistic random walk after 1199023 steps, saw 862548 distinct states, run finished after 3001 ms. (steps per millisecond=399 ) properties seen :0
[2024-05-22 17:29:47] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:47] [INFO ] Invariant cache hit.
[2024-05-22 17:29:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 363/385 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/418 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/462 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 363/385 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/418 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/462 variables, 37/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 560/560 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 81/81 places, 560/560 transitions.
RANDOM walk for 40010 steps (463 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (99 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1212867 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :0 out of 1
Probabilistic random walk after 1212867 steps, saw 872752 distinct states, run finished after 3001 ms. (steps per millisecond=404 ) properties seen :0
[2024-05-22 17:29:51] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:51] [INFO ] Invariant cache hit.
[2024-05-22 17:29:51] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 363/385 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/418 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/462 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 363/385 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/418 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/462 variables, 37/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 560/560 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 81/81 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 560/560 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2024-05-22 17:29:51] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:51] [INFO ] Invariant cache hit.
[2024-05-22 17:29:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 17:29:51] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:51] [INFO ] Invariant cache hit.
[2024-05-22 17:29:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:29:51] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-22 17:29:51] [INFO ] Redundant transitions in 5 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-22 17:29:51] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-05-22 17:29:51] [INFO ] Invariant cache hit.
[2024-05-22 17:29:51] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (OVERLAPS) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 124 constraints, problems are : Problem set: 0 solved, 558 unsolved in 9708 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 558/682 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 682 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
After SMT, in 40115ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 40121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40399 ms. Remains : 81/81 places, 560/560 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 81 transition count 381
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 179 place count 81 transition count 372
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 197 place count 72 transition count 372
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 1 with 4 rules applied. Total rules applied 201 place count 70 transition count 370
Applied a total of 201 rules in 8 ms. Remains 70 /81 variables (removed 11) and now considering 370/560 (removed 190) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 370 rows 70 cols
[2024-05-22 17:30:31] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 17:30:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 17:30:31] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 17:30:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 17:30:31] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 17:30:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 17:30:32] [INFO ] After 13ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 17:30:32] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 17:30:32] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 226 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p3s2-UpperBounds-02 in 133045 ms.
Starting property specific reduction for DoubleLock-PT-p3s2-UpperBounds-13
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 17:30:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 82 cols
[2024-05-22 17:30:32] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (122 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (25 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 17:30:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:30:32] [INFO ] Invariant cache hit.
[2024-05-22 17:30:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:30:32] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-22 17:30:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:30:32] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-05-22 17:30:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:30:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:30:32] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-22 17:30:32] [INFO ] [Nat]Added 41 Read/Feed constraints in 14 ms returned sat
[2024-05-22 17:30:32] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 25 ms.
[2024-05-22 17:30:32] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 568/568 transitions.
Graph (complete) has 915 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 81 /82 variables (removed 1) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 81/82 places, 568/568 transitions.
[2024-05-22 17:30:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {10=1, 15=1, 28=1, 286=1, 371=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {15=1, 28=1, 284=1, 370=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 195 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 17:30:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 81 cols
[2024-05-22 17:30:32] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (11775 resets) in 704 ms. (1418 steps per ms)
BEST_FIRST walk for 1000001 steps (2394 resets) in 402 ms. (2481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 17:30:33] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:30:33] [INFO ] Invariant cache hit.
[2024-05-22 17:30:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:30:33] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-22 17:30:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:30:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:30:33] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 17:30:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:30:33] [INFO ] [Nat]Added 41 Read/Feed constraints in 27 ms returned sat
[2024-05-22 17:30:34] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 22 ms.
[2024-05-22 17:30:34] [INFO ] Added : 0 causal constraints over 0 iterations in 43 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 81/81 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:30:34] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:30:34] [INFO ] Invariant cache hit.
[2024-05-22 17:30:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 17:30:34] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:30:34] [INFO ] Invariant cache hit.
[2024-05-22 17:30:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:30:34] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-22 17:30:34] [INFO ] Redundant transitions in 7 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:30:34] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:30:34] [INFO ] Invariant cache hit.
[2024-05-22 17:30:34] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12912 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43288ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43293ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43598 ms. Remains : 81/81 places, 568/568 transitions.
[2024-05-22 17:31:17] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {10=1, 15=1, 28=1, 286=1, 371=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {15=1, 28=1, 284=1, 370=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 181 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 17:31:17] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:31:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (11764 resets) in 717 ms. (1392 steps per ms)
BEST_FIRST walk for 1000001 steps (2408 resets) in 385 ms. (2590 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 17:31:19] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:31:19] [INFO ] Invariant cache hit.
[2024-05-22 17:31:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:31:19] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-22 17:31:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:31:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:31:19] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-22 17:31:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:31:19] [INFO ] [Nat]Added 41 Read/Feed constraints in 24 ms returned sat
[2024-05-22 17:31:19] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 22 ms.
[2024-05-22 17:31:19] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 81/81 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:31:19] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:31:19] [INFO ] Invariant cache hit.
[2024-05-22 17:31:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 17:31:19] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:31:19] [INFO ] Invariant cache hit.
[2024-05-22 17:31:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:31:19] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-22 17:31:19] [INFO ] Redundant transitions in 6 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:31:19] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:31:19] [INFO ] Invariant cache hit.
[2024-05-22 17:31:19] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12900 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43314ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43320ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43601 ms. Remains : 81/81 places, 568/568 transitions.
[2024-05-22 17:32:03] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
Found an invariant !
This invariant on transitions {10=1, 15=1, 28=1, 286=1, 371=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {15=1, 28=1, 284=1, 370=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 186 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 40013 steps (470 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (92 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1244018 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :0 out of 1
Probabilistic random walk after 1244018 steps, saw 902006 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :0
[2024-05-22 17:32:06] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:32:06] [INFO ] Invariant cache hit.
[2024-05-22 17:32:06] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 279/293 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/464 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 41/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/470 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 279/293 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/464 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 41/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/470 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/470 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 285ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 81/81 places, 568/568 transitions.
RANDOM walk for 40021 steps (462 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (96 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1250650 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 1
Probabilistic random walk after 1250650 steps, saw 906891 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
[2024-05-22 17:32:09] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:32:09] [INFO ] Invariant cache hit.
[2024-05-22 17:32:09] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 279/293 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/464 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 41/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/470 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 279/293 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/464 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 41/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/470 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/470 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 81/81 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:32:09] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:32:09] [INFO ] Invariant cache hit.
[2024-05-22 17:32:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 17:32:10] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:32:10] [INFO ] Invariant cache hit.
[2024-05-22 17:32:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:32:10] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-22 17:32:10] [INFO ] Redundant transitions in 3 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:32:10] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:32:10] [INFO ] Invariant cache hit.
[2024-05-22 17:32:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12766 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43158ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43459 ms. Remains : 81/81 places, 568/568 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 81 transition count 389
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 179 place count 81 transition count 381
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 195 place count 73 transition count 381
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 1 with 4 rules applied. Total rules applied 199 place count 71 transition count 379
Applied a total of 199 rules in 8 ms. Remains 71 /81 variables (removed 10) and now considering 379/568 (removed 189) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 379 rows 71 cols
[2024-05-22 17:32:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 17:32:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:32:53] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 17:32:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:32:53] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 17:32:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 17:32:53] [INFO ] After 13ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 17:32:53] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 17:32:53] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 236 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p3s2-UpperBounds-13 in 141605 ms.
[2024-05-22 17:32:53] [INFO ] Flatten gal took : 86 ms
[2024-05-22 17:32:53] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-22 17:32:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 568 transitions and 2240 arcs took 5 ms.
Total runtime 663498 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleLock-PT-p3s2
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 82
TRANSITIONS: 568
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 1147
MODEL NAME: /home/mcc/execution/412/model
82 places, 568 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
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="DoubleLock-PT-p3s2"
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 DoubleLock-PT-p3s2, 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 r135-tall-171631131500637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s2.tgz
mv DoubleLock-PT-p3s2 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 ;