About the Execution of LTSMin+red for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6254.775 | 1917588.00 | 2443036.00 | 3475.50 | 0 16 ? 0 16 ? 0 0 ? ? ? ? ? 16 ? 0 | 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.r496-tall-171640603100301.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 ltsminxred
Input is FunctionPointer-PT-c016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100301
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 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 4.2M 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 FunctionPointer-PT-c016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717192611136
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:56:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:56:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:56:52] [INFO ] Load time of PNML (sax parser for PT used): 391 ms
[2024-05-31 21:56:52] [INFO ] Transformed 2826 places.
[2024-05-31 21:56:52] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:56:52] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 548 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1198 places in 41 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:56:52] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 21:56:53] [INFO ] Computed 4 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 10007 steps (2 resets) in 226 ms. (44 steps per ms)
BEST_FIRST walk for 110011 steps (36 resets) in 300 ms. (365 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1, 2, 0, 0, 1, 0, 1, 1, 0] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-31 21:56:53] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-31 21:56:53] [INFO ] Invariant cache hit.
[2024-05-31 21:56:53] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned sat
[2024-05-31 21:56:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:56:54] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2024-05-31 21:56:54] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-31 21:56:55] [INFO ] [Real]Added 479 Read/Feed constraints in 155 ms returned sat
[2024-05-31 21:56:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:56:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:56:55] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2024-05-31 21:56:56] [INFO ] [Nat]Added 479 Read/Feed constraints in 92 ms returned sat
[2024-05-31 21:56:56] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 700 ms.
[2024-05-31 21:56:57] [INFO ] Added : 0 causal constraints over 0 iterations in 954 ms. Result :sat
Minimization took 589 ms.
[2024-05-31 21:56:57] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:56:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:56:58] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2024-05-31 21:56:58] [INFO ] [Real]Added 479 Read/Feed constraints in 131 ms returned sat
[2024-05-31 21:56:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:56:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:56:59] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-31 21:57:00] [INFO ] [Nat]Added 479 Read/Feed constraints in 142 ms returned sat
[2024-05-31 21:57:00] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 453 ms.
[2024-05-31 21:57:00] [INFO ] Added : 2 causal constraints over 1 iterations in 798 ms. Result :sat
Minimization took 578 ms.
[2024-05-31 21:57:01] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:57:01] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:02] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2024-05-31 21:57:02] [INFO ] [Real]Added 479 Read/Feed constraints in 128 ms returned sat
[2024-05-31 21:57:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:57:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:57:03] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2024-05-31 21:57:03] [INFO ] [Nat]Added 479 Read/Feed constraints in 91 ms returned sat
[2024-05-31 21:57:04] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 434 ms.
[2024-05-31 21:57:04] [INFO ] Added : 0 causal constraints over 0 iterations in 660 ms. Result :sat
Minimization took 579 ms.
[2024-05-31 21:57:05] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:57:05] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:05] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2024-05-31 21:57:06] [INFO ] [Real]Added 479 Read/Feed constraints in 165 ms returned sat
[2024-05-31 21:57:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:57:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:57:07] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2024-05-31 21:57:07] [INFO ] [Nat]Added 479 Read/Feed constraints in 147 ms returned sat
[2024-05-31 21:57:08] [INFO ] Deduced a trap composed of 142 places in 1292 ms of which 85 ms to minimize.
[2024-05-31 21:57:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1478 ms
[2024-05-31 21:57:09] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 438 ms.
[2024-05-31 21:57:09] [INFO ] Added : 2 causal constraints over 1 iterations in 764 ms. Result :sat
Minimization took 579 ms.
[2024-05-31 21:57:10] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:57:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-31 21:57:10] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2024-05-31 21:57:11] [INFO ] [Real]Added 479 Read/Feed constraints in 153 ms returned sat
[2024-05-31 21:57:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:57:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:12] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2024-05-31 21:57:12] [INFO ] [Nat]Added 479 Read/Feed constraints in 107 ms returned sat
[2024-05-31 21:57:12] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 473 ms.
[2024-05-31 21:57:14] [INFO ] Deduced a trap composed of 164 places in 1212 ms of which 13 ms to minimize.
[2024-05-31 21:57:15] [INFO ] Deduced a trap composed of 153 places in 1178 ms of which 11 ms to minimize.
[2024-05-31 21:57:17] [INFO ] Deduced a trap composed of 141 places in 1125 ms of which 11 ms to minimize.
[2024-05-31 21:57:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:57:17] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:57:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:57:17] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2024-05-31 21:57:18] [INFO ] [Real]Added 479 Read/Feed constraints in 199 ms returned sat
[2024-05-31 21:57:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:57:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:19] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2024-05-31 21:57:19] [INFO ] [Nat]Added 479 Read/Feed constraints in 105 ms returned sat
[2024-05-31 21:57:19] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 460 ms.
[2024-05-31 21:57:21] [INFO ] Deduced a trap composed of 142 places in 1171 ms of which 10 ms to minimize.
[2024-05-31 21:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1377 ms
[2024-05-31 21:57:21] [INFO ] Added : 2 causal constraints over 1 iterations in 2246 ms. Result :sat
Minimization took 583 ms.
[2024-05-31 21:57:22] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2024-05-31 21:57:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:23] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2024-05-31 21:57:23] [INFO ] [Real]Added 479 Read/Feed constraints in 108 ms returned sat
[2024-05-31 21:57:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:57:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:57:24] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-05-31 21:57:24] [INFO ] [Nat]Added 479 Read/Feed constraints in 102 ms returned sat
[2024-05-31 21:57:25] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 448 ms.
[2024-05-31 21:57:25] [INFO ] Added : 1 causal constraints over 1 iterations in 762 ms. Result :sat
Minimization took 581 ms.
[2024-05-31 21:57:26] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:57:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:27] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2024-05-31 21:57:27] [INFO ] [Real]Added 479 Read/Feed constraints in 111 ms returned sat
[2024-05-31 21:57:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:57:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:57:28] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2024-05-31 21:57:28] [INFO ] [Nat]Added 479 Read/Feed constraints in 324 ms returned sat
[2024-05-31 21:57:29] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 502 ms.
[2024-05-31 21:57:29] [INFO ] Added : 2 causal constraints over 1 iterations in 842 ms. Result :sat
Minimization took 585 ms.
[2024-05-31 21:57:30] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:57:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:30] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2024-05-31 21:57:31] [INFO ] [Real]Added 479 Read/Feed constraints in 158 ms returned sat
[2024-05-31 21:57:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:57:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:32] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2024-05-31 21:57:32] [INFO ] [Nat]Added 479 Read/Feed constraints in 110 ms returned sat
[2024-05-31 21:57:32] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 428 ms.
[2024-05-31 21:57:33] [INFO ] Added : 1 causal constraints over 1 iterations in 732 ms. Result :sat
Minimization took 581 ms.
[2024-05-31 21:57:33] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-31 21:57:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:57:34] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2024-05-31 21:57:34] [INFO ] [Real]Added 479 Read/Feed constraints in 128 ms returned sat
[2024-05-31 21:57:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:57:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:35] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2024-05-31 21:57:35] [INFO ] [Nat]Added 479 Read/Feed constraints in 151 ms returned sat
[2024-05-31 21:57:36] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 415 ms.
[2024-05-31 21:57:36] [INFO ] Added : 2 causal constraints over 1 iterations in 741 ms. Result :sat
Minimization took 578 ms.
[2024-05-31 21:57:37] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:57:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:57:38] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2024-05-31 21:57:38] [INFO ] [Real]Added 479 Read/Feed constraints in 134 ms returned sat
[2024-05-31 21:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:57:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:57:39] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2024-05-31 21:57:39] [INFO ] [Nat]Added 479 Read/Feed constraints in 88 ms returned sat
[2024-05-31 21:57:39] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 408 ms.
[2024-05-31 21:57:41] [INFO ] Deduced a trap composed of 142 places in 1102 ms of which 10 ms to minimize.
[2024-05-31 21:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1326 ms
[2024-05-31 21:57:41] [INFO ] Added : 2 causal constraints over 1 iterations in 2146 ms. Result :sat
Minimization took 577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 1, 2, 0, 0, 1, 0, 1, 1, 0] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 1, 2, 0, 0, 1, 0, 1, 1, 0] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 11 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.13 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1422 transition count 5583
Discarding 300 places :
Symmetric choice reduction at 1 with 300 rule applications. Total rules 680 place count 1122 transition count 3289
Iterating global reduction 1 with 300 rules applied. Total rules applied 980 place count 1122 transition count 3289
Ensure Unique test removed 350 transitions
Reduce isomorphic transitions removed 350 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 1330 place count 1122 transition count 2939
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1484 place count 968 transition count 2631
Iterating global reduction 2 with 154 rules applied. Total rules applied 1638 place count 968 transition count 2631
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1698 place count 968 transition count 2571
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1712 place count 954 transition count 2543
Iterating global reduction 3 with 14 rules applied. Total rules applied 1726 place count 954 transition count 2543
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1740 place count 940 transition count 2515
Iterating global reduction 3 with 14 rules applied. Total rules applied 1754 place count 940 transition count 2515
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1768 place count 926 transition count 2487
Iterating global reduction 3 with 14 rules applied. Total rules applied 1782 place count 926 transition count 2487
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1796 place count 912 transition count 2459
Iterating global reduction 3 with 14 rules applied. Total rules applied 1810 place count 912 transition count 2459
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1824 place count 898 transition count 2431
Iterating global reduction 3 with 14 rules applied. Total rules applied 1838 place count 898 transition count 2431
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1850 place count 886 transition count 2407
Iterating global reduction 3 with 12 rules applied. Total rules applied 1862 place count 886 transition count 2407
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1874 place count 874 transition count 2383
Iterating global reduction 3 with 12 rules applied. Total rules applied 1886 place count 874 transition count 2383
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1932 place count 828 transition count 2213
Iterating global reduction 3 with 46 rules applied. Total rules applied 1978 place count 828 transition count 2213
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2037 place count 769 transition count 1977
Iterating global reduction 3 with 59 rules applied. Total rules applied 2096 place count 769 transition count 1977
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2154 place count 711 transition count 1823
Iterating global reduction 3 with 58 rules applied. Total rules applied 2212 place count 711 transition count 1823
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2270 place count 653 transition count 1707
Iterating global reduction 3 with 58 rules applied. Total rules applied 2328 place count 653 transition count 1707
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2386 place count 595 transition count 1591
Iterating global reduction 3 with 58 rules applied. Total rules applied 2444 place count 595 transition count 1591
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2502 place count 537 transition count 1475
Iterating global reduction 3 with 58 rules applied. Total rules applied 2560 place count 537 transition count 1475
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2616 place count 481 transition count 1363
Iterating global reduction 3 with 56 rules applied. Total rules applied 2672 place count 481 transition count 1363
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 2691 place count 462 transition count 1325
Iterating global reduction 3 with 19 rules applied. Total rules applied 2710 place count 462 transition count 1325
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 2722 place count 462 transition count 1313
Applied a total of 2722 rules in 1075 ms. Remains 462 /1628 variables (removed 1166) and now considering 1313/5962 (removed 4649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1097 ms. Remains : 462/1628 places, 1313/5962 transitions.
[2024-05-31 21:57:43] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 4 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 11) seen :[0, 2, 1, 2, 2, 4, 4, 1, 7, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 2, 1, 2, 2, 4, 4, 1, 7, 1, 2] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-31 21:57:43] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-31 21:57:43] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 1, 2, 2, 4, 4, 1, 7, 1, 2] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2479 ms. (403 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 9652 ms. (1139 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 125, 2, 137, 14, 57, 516, 2, 12, 2, 5] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-31 21:57:55] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:57:55] [INFO ] Invariant cache hit.
[2024-05-31 21:57:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:57:56] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:57:56] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 21:57:56] [INFO ] [Real]Added 94 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:57:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:57:56] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:57:56] [INFO ] [Nat]Added 94 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:57:56] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 21:57:56] [INFO ] Added : 0 causal constraints over 0 iterations in 128 ms. Result :sat
Minimization took 269 ms.
[2024-05-31 21:57:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:57:57] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:57:57] [INFO ] [Real]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:57:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:57:57] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:57:57] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:57:57] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 68 ms.
[2024-05-31 21:57:57] [INFO ] Added : 3 causal constraints over 1 iterations in 188 ms. Result :sat
Minimization took 261 ms.
[2024-05-31 21:57:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:57:58] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:57:58] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:57:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:57:58] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:57:58] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:57:58] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 21:57:58] [INFO ] Added : 0 causal constraints over 0 iterations in 120 ms. Result :sat
Minimization took 260 ms.
[2024-05-31 21:57:58] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:57:59] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:57:59] [INFO ] [Real]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:57:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:57:59] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-31 21:57:59] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:57:59] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 73 ms.
[2024-05-31 21:57:59] [INFO ] Added : 6 causal constraints over 3 iterations in 246 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 21:58:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:00] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:58:00] [INFO ] [Real]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-31 21:58:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:00] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:58:00] [INFO ] [Nat]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:58:00] [INFO ] Deduced a trap composed of 120 places in 188 ms of which 3 ms to minimize.
[2024-05-31 21:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-31 21:58:00] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 79 ms.
[2024-05-31 21:58:01] [INFO ] Added : 5 causal constraints over 3 iterations in 229 ms. Result :sat
Minimization took 272 ms.
[2024-05-31 21:58:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:01] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:58:01] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:58:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:01] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:58:01] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:58:01] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 21:58:02] [INFO ] Added : 7 causal constraints over 2 iterations in 215 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 21:58:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:02] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:58:02] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:58:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:02] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 21:58:02] [INFO ] [Nat]Added 94 Read/Feed constraints in 42 ms returned sat
[2024-05-31 21:58:03] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 21:58:03] [INFO ] Added : 1 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 257 ms.
[2024-05-31 21:58:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:03] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:58:03] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:03] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:58:03] [INFO ] [Nat]Added 94 Read/Feed constraints in 59 ms returned sat
[2024-05-31 21:58:04] [INFO ] Deduced a trap composed of 87 places in 190 ms of which 3 ms to minimize.
[2024-05-31 21:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2024-05-31 21:58:04] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 71 ms.
[2024-05-31 21:58:04] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 279 ms.
[2024-05-31 21:58:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:04] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:58:04] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:58:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:05] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:58:05] [INFO ] [Nat]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:58:05] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 21:58:05] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 244 ms.
[2024-05-31 21:58:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:05] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:58:05] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:58:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:06] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:58:06] [INFO ] [Nat]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:58:06] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 21:58:06] [INFO ] Added : 1 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 271 ms.
[2024-05-31 21:58:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:06] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:58:06] [INFO ] [Real]Added 94 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:58:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:07] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:58:07] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:58:07] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 21:58:07] [INFO ] Added : 10 causal constraints over 4 iterations in 254 ms. Result :sat
Minimization took 263 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 125, 2, 137, 14, 57, 516, 2, 12, 2, 5] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
FORMULA FunctionPointer-PT-c016-UpperBounds-04 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 125, 137, 14, 57, 516, 15, 12, 15, 5] Max Struct:[16, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 10 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 50 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-31 21:58:08] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :[0, 0, 4, 6, 2, 0, 1, 0, 0, 0]
FORMULA FunctionPointer-PT-c016-UpperBounds-01 16 TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[125, 137, 14, 57, 516, 15, 12, 15, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-31 21:58:08] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:58:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[125, 137, 14, 57, 516, 15, 12, 15, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2415 ms. (413 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 7750 ms. (1161 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[125, 207, 154, 57, 516, 15, 15, 15, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-31 21:58:18] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:58:18] [INFO ] Invariant cache hit.
[2024-05-31 21:58:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:18] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:58:18] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 21:58:18] [INFO ] [Real]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:58:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:19] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:58:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:58:19] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 21:58:19] [INFO ] Added : 3 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 269 ms.
[2024-05-31 21:58:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:19] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:58:19] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:58:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:20] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-31 21:58:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:58:20] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 21:58:20] [INFO ] Added : 6 causal constraints over 3 iterations in 228 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 21:58:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:20] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:58:21] [INFO ] [Real]Added 94 Read/Feed constraints in 67 ms returned sat
[2024-05-31 21:58:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:21] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:58:21] [INFO ] [Nat]Added 94 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:58:21] [INFO ] Deduced a trap composed of 90 places in 201 ms of which 3 ms to minimize.
[2024-05-31 21:58:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-31 21:58:21] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 21:58:21] [INFO ] Added : 12 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 261 ms.
[2024-05-31 21:58:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:22] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:58:22] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:58:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:22] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:58:22] [INFO ] [Nat]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:58:22] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 21:58:22] [INFO ] Added : 7 causal constraints over 2 iterations in 212 ms. Result :sat
Minimization took 251 ms.
[2024-05-31 21:58:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:23] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:58:23] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:23] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:58:23] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:58:23] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-31 21:58:23] [INFO ] Added : 1 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 249 ms.
[2024-05-31 21:58:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:24] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:58:24] [INFO ] [Real]Added 94 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:58:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:24] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:58:24] [INFO ] [Nat]Added 94 Read/Feed constraints in 65 ms returned sat
[2024-05-31 21:58:24] [INFO ] Deduced a trap composed of 87 places in 191 ms of which 3 ms to minimize.
[2024-05-31 21:58:25] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 3 ms to minimize.
[2024-05-31 21:58:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 416 ms
[2024-05-31 21:58:25] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 61 ms.
[2024-05-31 21:58:25] [INFO ] Added : 2 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 286 ms.
[2024-05-31 21:58:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:25] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:58:25] [INFO ] [Real]Added 94 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:58:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:26] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:58:26] [INFO ] [Nat]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:58:26] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 21:58:26] [INFO ] Added : 1 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 254 ms.
[2024-05-31 21:58:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:26] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:58:26] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:58:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:27] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:58:27] [INFO ] [Nat]Added 94 Read/Feed constraints in 49 ms returned sat
[2024-05-31 21:58:27] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 70 ms.
[2024-05-31 21:58:27] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 268 ms.
[2024-05-31 21:58:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:27] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:58:27] [INFO ] [Real]Added 94 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:58:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:28] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-31 21:58:28] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:58:28] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 21:58:28] [INFO ] Added : 10 causal constraints over 4 iterations in 260 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[125, 207, 154, 57, 516, 15, 15, 15, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[125, 207, 154, 57, 516, 15, 15, 15, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 49 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 50 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-31 21:58:28] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:58:28] [INFO ] Invariant cache hit.
[2024-05-31 21:58:29] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-31 21:58:29] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:58:29] [INFO ] Invariant cache hit.
[2024-05-31 21:58:29] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 21:58:30] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1834 ms to find 0 implicit places.
[2024-05-31 21:58:30] [INFO ] Redundant transitions in 82 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-31 21:58:30] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:58:30] [INFO ] Invariant cache hit.
[2024-05-31 21:58:30] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-31 21:58:46] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64621ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64650ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66643 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-31 21:59:35] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :[0, 2, 5, 2, 8, 0, 4, 1, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[125, 207, 154, 57, 516, 15, 15, 15, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-31 21:59:35] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:59:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[125, 207, 154, 57, 516, 15, 15, 15, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2252 ms. (443 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 7859 ms. (1145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[125, 207, 154, 84, 516, 15, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-31 21:59:45] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:59:45] [INFO ] Invariant cache hit.
[2024-05-31 21:59:45] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:46] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:59:46] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 21:59:46] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:59:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:46] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:59:46] [INFO ] [Nat]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:59:46] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 21:59:46] [INFO ] Added : 3 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 269 ms.
[2024-05-31 21:59:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:47] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-31 21:59:47] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:59:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:47] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:59:47] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:59:47] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 21:59:47] [INFO ] Added : 6 causal constraints over 3 iterations in 232 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 21:59:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:48] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:59:48] [INFO ] [Real]Added 94 Read/Feed constraints in 66 ms returned sat
[2024-05-31 21:59:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:48] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:59:48] [INFO ] [Nat]Added 94 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:59:48] [INFO ] Deduced a trap composed of 90 places in 189 ms of which 3 ms to minimize.
[2024-05-31 21:59:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-31 21:59:48] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 21:59:49] [INFO ] Added : 12 causal constraints over 4 iterations in 242 ms. Result :sat
Minimization took 266 ms.
[2024-05-31 21:59:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:49] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:59:49] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:59:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:49] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:59:49] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:59:49] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 21:59:50] [INFO ] Added : 7 causal constraints over 2 iterations in 216 ms. Result :sat
Minimization took 261 ms.
[2024-05-31 21:59:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:50] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:59:50] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:59:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:50] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:59:50] [INFO ] [Nat]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-31 21:59:51] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 21:59:51] [INFO ] Added : 1 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 252 ms.
[2024-05-31 21:59:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:51] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:59:51] [INFO ] [Real]Added 94 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:59:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:51] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:59:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 60 ms returned sat
[2024-05-31 21:59:52] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:59:52] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 3 ms to minimize.
[2024-05-31 21:59:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
[2024-05-31 21:59:52] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 96 ms.
[2024-05-31 21:59:52] [INFO ] Added : 2 causal constraints over 1 iterations in 189 ms. Result :sat
Minimization took 289 ms.
[2024-05-31 21:59:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:53] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:59:53] [INFO ] [Real]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-31 21:59:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:53] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:59:53] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:59:53] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 21:59:53] [INFO ] Added : 1 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 257 ms.
[2024-05-31 21:59:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:54] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:59:54] [INFO ] [Real]Added 94 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:59:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:54] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:59:54] [INFO ] [Nat]Added 94 Read/Feed constraints in 49 ms returned sat
[2024-05-31 21:59:54] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 63 ms.
[2024-05-31 21:59:54] [INFO ] Added : 1 causal constraints over 1 iterations in 146 ms. Result :sat
Minimization took 267 ms.
[2024-05-31 21:59:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:55] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:59:55] [INFO ] [Real]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:59:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:55] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:59:55] [INFO ] [Nat]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:59:55] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 21:59:55] [INFO ] Added : 10 causal constraints over 4 iterations in 249 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[125, 207, 154, 84, 516, 15, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[125, 207, 154, 84, 516, 15, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 48 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 61 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-31 21:59:56] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:59:56] [INFO ] Invariant cache hit.
[2024-05-31 21:59:56] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-31 21:59:56] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:59:56] [INFO ] Invariant cache hit.
[2024-05-31 21:59:56] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 21:59:57] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
[2024-05-31 21:59:57] [INFO ] Redundant transitions in 26 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-31 21:59:57] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 21:59:57] [INFO ] Invariant cache hit.
[2024-05-31 21:59:57] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-31 22:00:13] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64243ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66049 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-31 22:01:02] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :[0, 2, 0, 2, 0, 4, 3, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[125, 207, 154, 84, 516, 15, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-31 22:01:02] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:01:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[125, 207, 154, 84, 516, 15, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000003 steps (2 resets) in 2406 ms. (415 steps per ms)
FORMULA FunctionPointer-PT-c016-UpperBounds-13 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8000008 steps (16 resets) in 6841 ms. (1169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[125, 207, 229, 84, 516, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:01:11] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:01:11] [INFO ] Invariant cache hit.
[2024-05-31 22:01:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:11] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:01:11] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:01:12] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:01:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:12] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-31 22:01:12] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:01:12] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 68 ms.
[2024-05-31 22:01:12] [INFO ] Added : 3 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 306 ms.
[2024-05-31 22:01:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:13] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-31 22:01:13] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:01:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:13] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-31 22:01:13] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:01:13] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 77 ms.
[2024-05-31 22:01:13] [INFO ] Added : 6 causal constraints over 3 iterations in 250 ms. Result :sat
Minimization took 294 ms.
[2024-05-31 22:01:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:14] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 22:01:14] [INFO ] [Real]Added 94 Read/Feed constraints in 68 ms returned sat
[2024-05-31 22:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:14] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:01:14] [INFO ] [Nat]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-31 22:01:14] [INFO ] Deduced a trap composed of 90 places in 213 ms of which 4 ms to minimize.
[2024-05-31 22:01:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2024-05-31 22:01:14] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:01:15] [INFO ] Added : 12 causal constraints over 4 iterations in 252 ms. Result :sat
Minimization took 294 ms.
[2024-05-31 22:01:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:15] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 22:01:15] [INFO ] [Real]Added 94 Read/Feed constraints in 42 ms returned sat
[2024-05-31 22:01:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:15] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:01:16] [INFO ] [Nat]Added 94 Read/Feed constraints in 47 ms returned sat
[2024-05-31 22:01:16] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:01:16] [INFO ] Added : 7 causal constraints over 2 iterations in 218 ms. Result :sat
Minimization took 294 ms.
[2024-05-31 22:01:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:16] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-31 22:01:16] [INFO ] [Real]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:01:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:17] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 22:01:17] [INFO ] [Nat]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:01:17] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:01:17] [INFO ] Added : 1 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 278 ms.
[2024-05-31 22:01:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:17] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-31 22:01:18] [INFO ] [Real]Added 94 Read/Feed constraints in 48 ms returned sat
[2024-05-31 22:01:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:18] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:01:18] [INFO ] [Nat]Added 94 Read/Feed constraints in 60 ms returned sat
[2024-05-31 22:01:18] [INFO ] Deduced a trap composed of 87 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:01:18] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:01:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
[2024-05-31 22:01:18] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:01:18] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 313 ms.
[2024-05-31 22:01:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:19] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:01:19] [INFO ] [Real]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:01:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:19] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 22:01:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:01:19] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:01:19] [INFO ] Added : 1 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 287 ms.
[2024-05-31 22:01:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:20] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:01:20] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:01:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:20] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:01:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:01:20] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:01:21] [INFO ] Added : 10 causal constraints over 4 iterations in 259 ms. Result :sat
Minimization took 291 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[125, 207, 229, 84, 516, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[125, 207, 229, 84, 516, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 47 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-31 22:01:21] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :[3, 2, 0, 2, 0, 0, 4, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[125, 207, 229, 84, 516, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:01:21] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:01:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[125, 207, 229, 84, 516, 15, 15, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2395 ms. (417 steps per ms)
BEST_FIRST walk for 8000007 steps (16 resets) in 6689 ms. (1195 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[133, 207, 229, 111, 516, 15, 417, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:01:30] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:01:30] [INFO ] Invariant cache hit.
[2024-05-31 22:01:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:31] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:01:31] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:01:31] [INFO ] [Real]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:31] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:01:31] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:01:31] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:01:31] [INFO ] Added : 3 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 22:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:32] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:01:32] [INFO ] [Real]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:01:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:32] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 22:01:32] [INFO ] [Nat]Added 94 Read/Feed constraints in 42 ms returned sat
[2024-05-31 22:01:32] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-31 22:01:32] [INFO ] Added : 6 causal constraints over 3 iterations in 222 ms. Result :sat
Minimization took 261 ms.
[2024-05-31 22:01:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:33] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:01:33] [INFO ] [Real]Added 94 Read/Feed constraints in 65 ms returned sat
[2024-05-31 22:01:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:33] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-31 22:01:33] [INFO ] [Nat]Added 94 Read/Feed constraints in 44 ms returned sat
[2024-05-31 22:01:33] [INFO ] Deduced a trap composed of 90 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:01:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2024-05-31 22:01:33] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:01:34] [INFO ] Added : 12 causal constraints over 4 iterations in 259 ms. Result :sat
Minimization took 266 ms.
[2024-05-31 22:01:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:34] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:01:34] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:01:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:34] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:01:34] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:01:34] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:01:35] [INFO ] Added : 7 causal constraints over 2 iterations in 210 ms. Result :sat
Minimization took 264 ms.
[2024-05-31 22:01:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:35] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:01:35] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:01:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:35] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:01:35] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:01:36] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-31 22:01:36] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 264 ms.
[2024-05-31 22:01:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:36] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:01:36] [INFO ] [Real]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-31 22:01:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:36] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:01:37] [INFO ] [Nat]Added 94 Read/Feed constraints in 61 ms returned sat
[2024-05-31 22:01:37] [INFO ] Deduced a trap composed of 87 places in 211 ms of which 4 ms to minimize.
[2024-05-31 22:01:37] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:01:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
[2024-05-31 22:01:37] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:01:37] [INFO ] Added : 2 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 361 ms.
[2024-05-31 22:01:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:38] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-31 22:01:38] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:01:38] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:01:38] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:01:38] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 63 ms.
[2024-05-31 22:01:38] [INFO ] Added : 1 causal constraints over 1 iterations in 146 ms. Result :sat
Minimization took 257 ms.
[2024-05-31 22:01:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:39] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:01:39] [INFO ] [Real]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:01:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:01:39] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-31 22:01:39] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:01:39] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-31 22:01:39] [INFO ] Added : 10 causal constraints over 4 iterations in 263 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[133, 207, 229, 111, 516, 15, 417, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[133, 207, 229, 111, 516, 16, 417, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 47 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 47 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-31 22:01:40] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:01:40] [INFO ] Invariant cache hit.
[2024-05-31 22:01:40] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-31 22:01:40] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:01:40] [INFO ] Invariant cache hit.
[2024-05-31 22:01:40] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:01:42] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2024-05-31 22:01:42] [INFO ] Redundant transitions in 24 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-31 22:01:42] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:01:42] [INFO ] Invariant cache hit.
[2024-05-31 22:01:42] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-31 22:01:58] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64710ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64727ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66536 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-31 22:02:46] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :[0, 3, 0, 3, 4, 0, 4, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[133, 207, 229, 111, 516, 16, 417, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:02:47] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:02:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[133, 207, 229, 111, 516, 16, 417, 130] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000010 steps (2 resets) in 2459 ms. (406 steps per ms)
BEST_FIRST walk for 8000007 steps (16 resets) in 6923 ms. (1155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[133, 207, 229, 111, 725, 16, 417, 176] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:02:56] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:02:56] [INFO ] Invariant cache hit.
[2024-05-31 22:02:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:02:56] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:02:56] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:02:56] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:02:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:02:57] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:02:57] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:02:57] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:02:57] [INFO ] Added : 3 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 274 ms.
[2024-05-31 22:02:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:02:57] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 22:02:57] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:02:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:02:58] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-31 22:02:58] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:02:58] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 68 ms.
[2024-05-31 22:02:58] [INFO ] Added : 6 causal constraints over 3 iterations in 224 ms. Result :sat
Minimization took 272 ms.
[2024-05-31 22:02:58] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:02:58] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:02:59] [INFO ] [Real]Added 94 Read/Feed constraints in 69 ms returned sat
[2024-05-31 22:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:02:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:02:59] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:02:59] [INFO ] [Nat]Added 94 Read/Feed constraints in 54 ms returned sat
[2024-05-31 22:02:59] [INFO ] Deduced a trap composed of 90 places in 192 ms of which 3 ms to minimize.
[2024-05-31 22:02:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-31 22:02:59] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 61 ms.
[2024-05-31 22:02:59] [INFO ] Added : 12 causal constraints over 4 iterations in 246 ms. Result :sat
Minimization took 280 ms.
[2024-05-31 22:03:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:03:00] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 22:03:00] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:03:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:03:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:03:00] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:03:00] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:03:00] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 68 ms.
[2024-05-31 22:03:00] [INFO ] Added : 7 causal constraints over 2 iterations in 217 ms. Result :sat
Minimization took 272 ms.
[2024-05-31 22:03:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:03:01] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 22:03:01] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:03:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:03:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:03:01] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:03:01] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:03:01] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:03:01] [INFO ] Added : 1 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 264 ms.
[2024-05-31 22:03:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:03:02] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:03:02] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-31 22:03:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:03:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:03:02] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 22:03:02] [INFO ] [Nat]Added 94 Read/Feed constraints in 66 ms returned sat
[2024-05-31 22:03:02] [INFO ] Deduced a trap composed of 135 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:03:03] [INFO ] Deduced a trap composed of 126 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:03:03] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:03:03] [INFO ] Deduced a trap composed of 124 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:03:03] [INFO ] Deduced a trap composed of 120 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:03:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1066 ms
[2024-05-31 22:03:03] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:03:03] [INFO ] Added : 3 causal constraints over 1 iterations in 150 ms. Result :sat
Minimization took 285 ms.
[2024-05-31 22:03:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:03:04] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:03:04] [INFO ] [Real]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:03:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:03:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:03:04] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 22:03:04] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:03:04] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:03:04] [INFO ] Added : 1 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 263 ms.
[2024-05-31 22:03:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:03:05] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 22:03:05] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:03:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:03:05] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:03:05] [INFO ] [Nat]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:03:05] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:03:06] [INFO ] Added : 10 causal constraints over 4 iterations in 251 ms. Result :sat
Minimization took 266 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[133, 207, 229, 111, 725, 16, 417, 176] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[133, 207, 229, 111, 725, 16, 417, 176] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 47 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 48 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-31 22:03:06] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:03:06] [INFO ] Invariant cache hit.
[2024-05-31 22:03:06] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-31 22:03:06] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:03:06] [INFO ] Invariant cache hit.
[2024-05-31 22:03:07] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:03:08] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
[2024-05-31 22:03:08] [INFO ] Redundant transitions in 20 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-31 22:03:08] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:03:08] [INFO ] Invariant cache hit.
[2024-05-31 22:03:08] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-31 22:03:23] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64165ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65974 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-31 22:04:12] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :[1, 2, 2, 1, 0, 0, 5, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[133, 207, 229, 111, 725, 16, 417, 176] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:04:12] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:04:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[133, 207, 229, 111, 725, 16, 417, 176] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 2367 ms. (422 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 6832 ms. (1170 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:04:21] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:04:21] [INFO ] Invariant cache hit.
[2024-05-31 22:04:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:22] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:04:22] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:04:22] [INFO ] [Real]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-31 22:04:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:04:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:04:22] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 22:04:22] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:04:22] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:04:22] [INFO ] Added : 3 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 277 ms.
[2024-05-31 22:04:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:23] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 22:04:23] [INFO ] [Real]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:04:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:04:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:23] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:04:23] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:04:23] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 74 ms.
[2024-05-31 22:04:23] [INFO ] Added : 6 causal constraints over 3 iterations in 244 ms. Result :sat
Minimization took 267 ms.
[2024-05-31 22:04:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:24] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:04:24] [INFO ] [Real]Added 94 Read/Feed constraints in 69 ms returned sat
[2024-05-31 22:04:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:04:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:24] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:04:24] [INFO ] [Nat]Added 94 Read/Feed constraints in 44 ms returned sat
[2024-05-31 22:04:24] [INFO ] Deduced a trap composed of 90 places in 202 ms of which 3 ms to minimize.
[2024-05-31 22:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-05-31 22:04:24] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:04:25] [INFO ] Added : 12 causal constraints over 4 iterations in 262 ms. Result :sat
Minimization took 278 ms.
[2024-05-31 22:04:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:25] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:04:25] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:04:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:04:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:25] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:04:25] [INFO ] [Nat]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:04:26] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:04:26] [INFO ] Added : 7 causal constraints over 2 iterations in 212 ms. Result :sat
Minimization took 268 ms.
[2024-05-31 22:04:26] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:04:26] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 22:04:26] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:04:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:04:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:27] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:04:27] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-31 22:04:27] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:04:27] [INFO ] Added : 1 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 264 ms.
[2024-05-31 22:04:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:27] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:04:27] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-31 22:04:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:04:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:27] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:04:28] [INFO ] [Nat]Added 94 Read/Feed constraints in 63 ms returned sat
[2024-05-31 22:04:28] [INFO ] Deduced a trap composed of 135 places in 195 ms of which 3 ms to minimize.
[2024-05-31 22:04:28] [INFO ] Deduced a trap composed of 126 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:04:28] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:04:28] [INFO ] Deduced a trap composed of 124 places in 191 ms of which 14 ms to minimize.
[2024-05-31 22:04:29] [INFO ] Deduced a trap composed of 120 places in 183 ms of which 2 ms to minimize.
[2024-05-31 22:04:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1061 ms
[2024-05-31 22:04:29] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:04:29] [INFO ] Added : 3 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 287 ms.
[2024-05-31 22:04:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:29] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:04:29] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:04:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:04:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:04:30] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:04:30] [INFO ] [Nat]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:04:30] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-31 22:04:30] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 22:04:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:04:30] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 22:04:30] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-31 22:04:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:04:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:04:31] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:04:31] [INFO ] [Nat]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:04:31] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:04:31] [INFO ] Added : 10 causal constraints over 4 iterations in 266 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 55 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 48 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-31 22:04:31] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:04:31] [INFO ] Invariant cache hit.
[2024-05-31 22:04:32] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-31 22:04:32] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:04:32] [INFO ] Invariant cache hit.
[2024-05-31 22:04:32] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:04:33] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
[2024-05-31 22:04:33] [INFO ] Redundant transitions in 16 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-31 22:04:33] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:04:33] [INFO ] Invariant cache hit.
[2024-05-31 22:04:33] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-31 22:04:48] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64136ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65927 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-31 22:05:37] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :[1, 3, 0, 2, 0, 2, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:05:38] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:05:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000003 steps (2 resets) in 2350 ms. (425 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 6809 ms. (1174 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:05:47] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:05:47] [INFO ] Invariant cache hit.
[2024-05-31 22:05:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:47] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:05:47] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:05:47] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:05:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:47] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:05:47] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:05:47] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:05:47] [INFO ] Added : 3 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 22:05:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:48] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-31 22:05:48] [INFO ] [Real]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-31 22:05:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:05:48] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-31 22:05:48] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:05:48] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:05:49] [INFO ] Added : 6 causal constraints over 3 iterations in 225 ms. Result :sat
Minimization took 260 ms.
[2024-05-31 22:05:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:49] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:05:49] [INFO ] [Real]Added 94 Read/Feed constraints in 65 ms returned sat
[2024-05-31 22:05:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:49] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:05:49] [INFO ] [Nat]Added 94 Read/Feed constraints in 44 ms returned sat
[2024-05-31 22:05:50] [INFO ] Deduced a trap composed of 90 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:05:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-31 22:05:50] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-31 22:05:50] [INFO ] Added : 12 causal constraints over 4 iterations in 255 ms. Result :sat
Minimization took 268 ms.
[2024-05-31 22:05:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:50] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 22:05:50] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:05:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:51] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-31 22:05:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:05:51] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:05:51] [INFO ] Added : 7 causal constraints over 2 iterations in 202 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 22:05:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:51] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:05:52] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:05:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:52] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:05:52] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:05:52] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:05:52] [INFO ] Added : 1 causal constraints over 1 iterations in 148 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 22:05:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:05:52] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:05:53] [INFO ] [Real]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-31 22:05:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:05:53] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:05:53] [INFO ] [Nat]Added 94 Read/Feed constraints in 65 ms returned sat
[2024-05-31 22:05:53] [INFO ] Deduced a trap composed of 135 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:05:53] [INFO ] Deduced a trap composed of 126 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:05:53] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:05:54] [INFO ] Deduced a trap composed of 124 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:05:54] [INFO ] Deduced a trap composed of 120 places in 192 ms of which 4 ms to minimize.
[2024-05-31 22:05:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1087 ms
[2024-05-31 22:05:54] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:05:54] [INFO ] Added : 3 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 280 ms.
[2024-05-31 22:05:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:05:55] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:05:55] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:05:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:05:55] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 22:05:55] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:05:55] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:05:55] [INFO ] Added : 1 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 260 ms.
[2024-05-31 22:05:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:05:56] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 22:05:56] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-31 22:05:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:05:56] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 22:05:56] [INFO ] [Nat]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-31 22:05:56] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:05:56] [INFO ] Added : 10 causal constraints over 4 iterations in 256 ms. Result :sat
Minimization took 266 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 47 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 47 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-31 22:05:57] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:05:57] [INFO ] Invariant cache hit.
[2024-05-31 22:05:57] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-31 22:05:57] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:05:57] [INFO ] Invariant cache hit.
[2024-05-31 22:05:57] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:05:58] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
[2024-05-31 22:05:58] [INFO ] Redundant transitions in 17 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-31 22:05:58] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:05:58] [INFO ] Invariant cache hit.
[2024-05-31 22:05:58] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-31 22:06:14] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64183ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65967 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-31 22:07:03] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :[1, 2, 0, 2, 4, 0, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (8 resets) in 864 ms. (46 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 208802 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 8
Probabilistic random walk after 208802 steps, saw 129214 distinct states, run finished after 3004 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-31 22:07:06] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:07:06] [INFO ] Invariant cache hit.
[2024-05-31 22:07:06] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 404/434 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 13/447 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 638/1085 variables, 361/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1085 variables, 92/485 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 62/1147 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1147 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 73/1220 variables, 73/559 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1220 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/1220 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 559 constraints, problems are : Problem set: 0 solved, 8 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 404/434 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 13/447 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 638/1085 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 92/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1085 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1085 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 62/1147 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1147 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 73/1220 variables, 73/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1220 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/1220 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 567 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1925ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 48369 ms.
Support contains 7 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 461 transition count 1311
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 461 transition count 1311
Applied a total of 2 rules in 60 ms. Remains 461 /462 variables (removed 1) and now considering 1311/1313 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 461/462 places, 1311/1313 transitions.
RANDOM walk for 40001 steps (8 resets) in 256 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 204205 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 7
Probabilistic random walk after 204205 steps, saw 126370 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-31 22:08:00] [INFO ] Flow matrix only has 755 transitions (discarded 556 similar events)
// Phase 1: matrix 755 rows 461 cols
[2024-05-31 22:08:00] [INFO ] Computed 3 invariants in 11 ms
[2024-05-31 22:08:00] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 19/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 404/430 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 13/443 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 638/1081 variables, 361/392 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 90/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 62/1143 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1143 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 73/1216 variables, 73/556 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1216 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1216 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 556 constraints, problems are : Problem set: 0 solved, 7 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 461/461 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 19/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 404/430 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 13/443 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 638/1081 variables, 361/397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 90/487 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1081 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1081 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 62/1143 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:08:02] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1143 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1143 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 73/1216 variables, 73/564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1216 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/1216 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 564 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1325 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 461/461 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2173ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 38110 ms.
Support contains 6 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1311/1311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 460 transition count 1309
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 1309
Applied a total of 2 rules in 68 ms. Remains 460 /461 variables (removed 1) and now considering 1309/1311 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 460/461 places, 1309/1311 transitions.
RANDOM walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 210835 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 6
Probabilistic random walk after 210835 steps, saw 130472 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-31 22:08:44] [INFO ] Flow matrix only has 752 transitions (discarded 557 similar events)
// Phase 1: matrix 752 rows 460 cols
[2024-05-31 22:08:44] [INFO ] Computed 3 invariants in 5 ms
[2024-05-31 22:08:44] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 401/423 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 13/436 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 640/1076 variables, 361/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1076 variables, 88/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1076 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 62/1138 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1138 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 74/1212 variables, 74/553 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1212 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1212 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1212/1212 variables, and 553 constraints, problems are : Problem set: 0 solved, 6 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 460/460 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 401/423 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 13/436 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 640/1076 variables, 361/395 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1076 variables, 88/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1076 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1076 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 62/1138 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:08:45] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1138 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1138 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 74/1212 variables, 74/560 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1212 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1212 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1212/1212 variables, and 560 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 460/460 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1874ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 34891 ms.
Support contains 6 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1309/1309 transitions.
Applied a total of 0 rules in 50 ms. Remains 460 /460 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 460/460 places, 1309/1309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1309/1309 transitions.
Applied a total of 0 rules in 49 ms. Remains 460 /460 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
[2024-05-31 22:09:20] [INFO ] Flow matrix only has 752 transitions (discarded 557 similar events)
[2024-05-31 22:09:20] [INFO ] Invariant cache hit.
[2024-05-31 22:09:21] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-31 22:09:21] [INFO ] Flow matrix only has 752 transitions (discarded 557 similar events)
[2024-05-31 22:09:21] [INFO ] Invariant cache hit.
[2024-05-31 22:09:21] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 22:09:22] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
[2024-05-31 22:09:22] [INFO ] Redundant transitions in 21 ms returned []
Running 1307 sub problems to find dead transitions.
[2024-05-31 22:09:22] [INFO ] Flow matrix only has 752 transitions (discarded 557 similar events)
[2024-05-31 22:09:22] [INFO ] Invariant cache hit.
[2024-05-31 22:09:22] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
[2024-05-31 22:09:37] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 2 ms to minimize.
[2024-05-31 22:09:38] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1212 variables, and 5 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/460 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1307/1307 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 3 (OVERLAPS) 752/1212 variables, 460/465 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 90/555 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1212 variables, 1307/1862 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/1212 variables, and 1862 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 460/460 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1307/1307 constraints, Known Traps: 2/2 constraints]
After SMT, in 64487ms problems are : Problem set: 0 solved, 1307 unsolved
Search for dead transitions found 0 dead transitions in 64505ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66208 ms. Remains : 460/460 places, 1309/1309 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[133, 207, 229, 111, 824, 16, 417, 197] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c016-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-31 22:10:27] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-31 22:10:27] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:10:27] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:10:27] [INFO ] Invariant cache hit.
[2024-05-31 22:10:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:10:27] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:10:27] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:10:27] [INFO ] [Real]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:10:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:10:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:10:27] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 22:10:27] [INFO ] [Nat]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-31 22:10:27] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 70 ms.
[2024-05-31 22:10:27] [INFO ] Added : 3 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 448 transition count 1280
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 448 transition count 1280
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 448 transition count 1276
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 444 transition count 1268
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 444 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 48 place count 440 transition count 1258
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 440 transition count 1258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 436 transition count 1248
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 436 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 432 transition count 1240
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 429 transition count 1234
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 426 transition count 1228
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 424 transition count 1224
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 422 transition count 1220
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 421 transition count 1218
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 421 transition count 1218
Applied a total of 90 rules in 148 ms. Remains 421 /462 variables (removed 41) and now considering 1218/1313 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 421/462 places, 1218/1313 transitions.
[2024-05-31 22:10:28] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:10:28] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-31 22:10:28] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2051 ms. (487 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 683 ms. (1461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:10:31] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:10:31] [INFO ] Invariant cache hit.
[2024-05-31 22:10:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:10:31] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-31 22:10:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:10:31] [INFO ] [Real]Added 75 Read/Feed constraints in 24 ms returned sat
[2024-05-31 22:10:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:10:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:10:31] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-31 22:10:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:10:31] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-05-31 22:10:31] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 58 ms.
[2024-05-31 22:10:32] [INFO ] Added : 8 causal constraints over 3 iterations in 210 ms. Result :sat
Minimization took 237 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 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:10:32] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:10:32] [INFO ] Invariant cache hit.
[2024-05-31 22:10:32] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-31 22:10:32] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:10:32] [INFO ] Invariant cache hit.
[2024-05-31 22:10:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:10:33] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
[2024-05-31 22:10:34] [INFO ] Redundant transitions in 20 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:10:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:10:34] [INFO ] Invariant cache hit.
[2024-05-31 22:10:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:10:47] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 2 ms to minimize.
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33895ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33905ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35472 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 22:11:07] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 552130 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 552130 steps, saw 338558 distinct states, run finished after 3002 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-31 22:11:11] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:11:11] [INFO ] Invariant cache hit.
[2024-05-31 22:11:11] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40001 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 551141 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 551141 steps, saw 337952 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-31 22:11:14] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:11:14] [INFO ] Invariant cache hit.
[2024-05-31 22:11:14] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:11:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:11:15] [INFO ] Invariant cache hit.
[2024-05-31 22:11:15] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-31 22:11:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:11:15] [INFO ] Invariant cache hit.
[2024-05-31 22:11:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:11:17] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1509 ms to find 0 implicit places.
[2024-05-31 22:11:17] [INFO ] Redundant transitions in 17 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:11:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:11:17] [INFO ] Invariant cache hit.
[2024-05-31 22:11:17] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:11:30] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 3 ms to minimize.
[2024-05-31 22:11:30] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33740ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33749ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35325 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 76 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 22:11:50] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 22:11:50] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:11:50] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:11:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:11:50] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:11:50] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:11:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:11:50] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:11:50] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:11:50] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:11:50] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 150 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-02 in 83968 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-05
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-31 22:11:51] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-31 22:11:51] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10006 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:11:51] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:11:51] [INFO ] Invariant cache hit.
[2024-05-31 22:11:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:11:51] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 22:11:51] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:11:51] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:11:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:11:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:11:51] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:11:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:11:51] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:11:51] [INFO ] Added : 5 causal constraints over 3 iterations in 226 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 453 transition count 1294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 448 transition count 1280
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 448 transition count 1280
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 448 transition count 1276
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 38 place count 444 transition count 1268
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 444 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 46 place count 440 transition count 1260
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 440 transition count 1260
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 54 place count 436 transition count 1250
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 436 transition count 1250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 62 place count 432 transition count 1242
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 432 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 429 transition count 1236
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 429 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 426 transition count 1230
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 426 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 425 transition count 1228
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 425 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 424 transition count 1226
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 423 transition count 1224
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 423 transition count 1224
Applied a total of 84 rules in 191 ms. Remains 423 /462 variables (removed 39) and now considering 1224/1313 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 423/462 places, 1224/1313 transitions.
[2024-05-31 22:11:52] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-31 22:11:52] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2024-05-31 22:11:52] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2074 ms. (481 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 757 ms. (1319 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[210] Max Struct:[+inf]
[2024-05-31 22:11:55] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:11:55] [INFO ] Invariant cache hit.
[2024-05-31 22:11:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:11:55] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 22:11:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:11:55] [INFO ] [Real]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:11:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:11:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:11:55] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 22:11:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:11:56] [INFO ] Deduced a trap composed of 113 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:11:56] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:11:56] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 2 ms to minimize.
[2024-05-31 22:11:56] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 5 ms to minimize.
[2024-05-31 22:11:56] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:11:57] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 2 ms to minimize.
[2024-05-31 22:11:57] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:11:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1370 ms
[2024-05-31 22:11:57] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 60 ms.
[2024-05-31 22:11:57] [INFO ] Added : 22 causal constraints over 5 iterations in 278 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[210] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[210] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 51 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 22:11:59] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:11:59] [INFO ] Invariant cache hit.
[2024-05-31 22:11:59] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-31 22:11:59] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:11:59] [INFO ] Invariant cache hit.
[2024-05-31 22:11:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:12:00] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1558 ms to find 0 implicit places.
[2024-05-31 22:12:00] [INFO ] Redundant transitions in 22 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 22:12:00] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:12:00] [INFO ] Invariant cache hit.
[2024-05-31 22:12:00] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 22:12:13] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 2 ms to minimize.
[2024-05-31 22:12:14] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/428 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 33705ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 33714ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35348 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 22:12:34] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[210] Max Struct:[+inf]
[2024-05-31 22:12:34] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:12:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[210] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2248 ms. (444 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 840 ms. (1189 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[210] Max Struct:[+inf]
[2024-05-31 22:12:37] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:12:37] [INFO ] Invariant cache hit.
[2024-05-31 22:12:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:12:37] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-31 22:12:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:12:37] [INFO ] [Real]Added 75 Read/Feed constraints in 30 ms returned sat
[2024-05-31 22:12:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:12:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:12:38] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-31 22:12:38] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:12:38] [INFO ] Deduced a trap composed of 113 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:12:38] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:12:38] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:12:38] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:12:39] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 2 ms to minimize.
[2024-05-31 22:12:39] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:12:39] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:12:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1384 ms
[2024-05-31 22:12:39] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 66 ms.
[2024-05-31 22:12:39] [INFO ] Added : 22 causal constraints over 5 iterations in 294 ms. Result :sat
Minimization took 248 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[210] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[210] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 55 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 22:12:41] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:12:41] [INFO ] Invariant cache hit.
[2024-05-31 22:12:41] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-31 22:12:41] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:12:41] [INFO ] Invariant cache hit.
[2024-05-31 22:12:41] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:12:42] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2024-05-31 22:12:42] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 22:12:42] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:12:42] [INFO ] Invariant cache hit.
[2024-05-31 22:12:42] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 22:12:56] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 2 ms to minimize.
[2024-05-31 22:12:57] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/428 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34117ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35780 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 22:13:17] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[210] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 542268 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 542268 steps, saw 332511 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-31 22:13:20] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:13:20] [INFO ] Invariant cache hit.
[2024-05-31 22:13:20] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1263 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 523705 steps, run timeout after 3004 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 523705 steps, saw 321130 distinct states, run finished after 3004 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-31 22:13:25] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:13:25] [INFO ] Invariant cache hit.
[2024-05-31 22:13:25] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 630ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1294 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 41 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 22:13:27] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:13:27] [INFO ] Invariant cache hit.
[2024-05-31 22:13:27] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-31 22:13:27] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:13:27] [INFO ] Invariant cache hit.
[2024-05-31 22:13:27] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:13:28] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2024-05-31 22:13:28] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 22:13:28] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 22:13:28] [INFO ] Invariant cache hit.
[2024-05-31 22:13:28] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 22:13:42] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:13:43] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/428 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34486ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34496ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36165 ms. Remains : 423/423 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 423 transition count 681
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 553 place count 413 transition count 681
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 413 transition count 608
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 699 place count 340 transition count 608
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 955 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1403 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1405 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 19 transition count 31
Applied a total of 1408 rules in 28 ms. Remains 19 /423 variables (removed 404) and now considering 31/1224 (removed 1193) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 22:14:03] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 22:14:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:14:03] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:14:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:14:03] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:14:03] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:14:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:14:03] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:14:03] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:14:03] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:14:03] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 97 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[210] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-05 in 132558 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:14:03] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-31 22:14:03] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:14:03] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:14:03] [INFO ] Invariant cache hit.
[2024-05-31 22:14:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:14:03] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 22:14:03] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:14:03] [INFO ] [Real]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:14:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:14:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:14:04] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:14:04] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:14:04] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 77 ms.
[2024-05-31 22:14:04] [INFO ] Added : 3 causal constraints over 1 iterations in 188 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 448 transition count 1278
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 448 transition count 1278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 448 transition count 1274
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 444 transition count 1266
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 444 transition count 1266
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 48 place count 440 transition count 1256
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 440 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 436 transition count 1246
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 436 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 432 transition count 1238
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 432 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 428 transition count 1230
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 428 transition count 1230
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 424 transition count 1222
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 424 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 422 transition count 1218
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 422 transition count 1218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 420 transition count 1214
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 419 transition count 1212
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 419 transition count 1212
Applied a total of 94 rules in 165 ms. Remains 419 /462 variables (removed 43) and now considering 1212/1313 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 419/462 places, 1212/1313 transitions.
[2024-05-31 22:14:04] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:14:05] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-31 22:14:05] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2134 ms. (468 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 766 ms. (1303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[639] Max Struct:[+inf]
[2024-05-31 22:14:08] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:14:08] [INFO ] Invariant cache hit.
[2024-05-31 22:14:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:14:08] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-31 22:14:08] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:14:08] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:14:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:14:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:14:08] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-31 22:14:08] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:14:08] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 7 ms to minimize.
[2024-05-31 22:14:08] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:14:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2024-05-31 22:14:09] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 59 ms.
[2024-05-31 22:14:09] [INFO ] Added : 17 causal constraints over 5 iterations in 318 ms. Result :sat
Minimization took 301 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[639] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[639] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 41 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 40 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-31 22:14:12] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:14:12] [INFO ] Invariant cache hit.
[2024-05-31 22:14:12] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-31 22:14:12] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:14:12] [INFO ] Invariant cache hit.
[2024-05-31 22:14:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:14:14] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2024-05-31 22:14:14] [INFO ] Redundant transitions in 22 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-31 22:14:14] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:14:14] [INFO ] Invariant cache hit.
[2024-05-31 22:14:14] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-31 22:14:27] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 2 ms to minimize.
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/424 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34034ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35731 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-31 22:14:48] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[639] Max Struct:[+inf]
[2024-05-31 22:14:48] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:14:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[639] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2127 ms. (469 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 793 ms. (1259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[639] Max Struct:[+inf]
[2024-05-31 22:14:51] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:14:51] [INFO ] Invariant cache hit.
[2024-05-31 22:14:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:14:51] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-31 22:14:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:14:51] [INFO ] [Real]Added 75 Read/Feed constraints in 35 ms returned sat
[2024-05-31 22:14:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:14:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:14:52] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-31 22:14:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:14:52] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:14:52] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 2 ms to minimize.
[2024-05-31 22:14:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2024-05-31 22:14:52] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 59 ms.
[2024-05-31 22:14:52] [INFO ] Added : 17 causal constraints over 5 iterations in 312 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[639] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[639] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 41 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-31 22:14:56] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:14:56] [INFO ] Invariant cache hit.
[2024-05-31 22:14:56] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-31 22:14:56] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:14:56] [INFO ] Invariant cache hit.
[2024-05-31 22:14:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:14:57] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1549 ms to find 0 implicit places.
[2024-05-31 22:14:57] [INFO ] Redundant transitions in 14 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-31 22:14:57] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:14:57] [INFO ] Invariant cache hit.
[2024-05-31 22:14:57] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-31 22:15:11] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 2 ms to minimize.
[2024-05-31 22:15:11] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/424 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34034ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35661 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-31 22:15:31] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[639] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527797 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527797 steps, saw 323639 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-31 22:15:35] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:15:35] [INFO ] Invariant cache hit.
[2024-05-31 22:15:35] [INFO ] State equation strengthened by 75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2670 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 41 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 419/419 places, 1212/1212 transitions.
RANDOM walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 530515 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 530515 steps, saw 325306 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-31 22:15:41] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:15:41] [INFO ] Invariant cache hit.
[2024-05-31 22:15:41] [INFO ] State equation strengthened by 75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 614ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2646 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 41 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 46 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-31 22:15:44] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:15:44] [INFO ] Invariant cache hit.
[2024-05-31 22:15:45] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-31 22:15:45] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:15:45] [INFO ] Invariant cache hit.
[2024-05-31 22:15:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:15:46] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2024-05-31 22:15:46] [INFO ] Redundant transitions in 20 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-31 22:15:46] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 22:15:46] [INFO ] Invariant cache hit.
[2024-05-31 22:15:46] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-31 22:16:00] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 2 ms to minimize.
[2024-05-31 22:16:00] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/424 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34280ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35924 ms. Remains : 419/419 places, 1212/1212 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 419 transition count 673
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 551 place count 407 transition count 673
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 551 place count 407 transition count 604
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 689 place count 338 transition count 604
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 945 place count 210 transition count 476
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1009 place count 146 transition count 348
Iterating global reduction 2 with 64 rules applied. Total rules applied 1073 place count 146 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1074 place count 146 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1074 place count 146 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1076 place count 145 transition count 346
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1139 place count 82 transition count 220
Iterating global reduction 3 with 63 rules applied. Total rules applied 1202 place count 82 transition count 220
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1265 place count 19 transition count 94
Iterating global reduction 3 with 63 rules applied. Total rules applied 1328 place count 19 transition count 94
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1391 place count 19 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1391 place count 19 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1393 place count 18 transition count 30
Applied a total of 1393 rules in 22 ms. Remains 18 /419 variables (removed 401) and now considering 30/1212 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2024-05-31 22:16:20] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 22:16:20] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:16:20] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:16:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:16:20] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:16:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:16:20] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:16:20] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:16:20] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 102 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[639] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-08 in 137246 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-09
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-31 22:16:20] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-31 22:16:20] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:16:20] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:16:20] [INFO ] Invariant cache hit.
[2024-05-31 22:16:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:16:21] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 22:16:21] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:16:21] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:16:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:16:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:16:21] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 22:16:21] [INFO ] [Nat]Added 94 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:16:21] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-31 22:16:21] [INFO ] Added : 12 causal constraints over 4 iterations in 279 ms. Result :sat
Minimization took 277 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 453 transition count 1294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 449 transition count 1282
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 449 transition count 1282
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 445 transition count 1274
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 445 transition count 1274
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 441 transition count 1264
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 441 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 437 transition count 1256
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 437 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 433 transition count 1248
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 433 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 430 transition count 1242
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 430 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 427 transition count 1236
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 427 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 426 transition count 1234
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 426 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 425 transition count 1232
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 425 transition count 1232
Applied a total of 76 rules in 135 ms. Remains 425 /462 variables (removed 37) and now considering 1232/1313 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 425/462 places, 1232/1313 transitions.
[2024-05-31 22:16:22] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:16:22] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2024-05-31 22:16:22] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2322 ms. (430 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 810 ms. (1233 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[136] Max Struct:[+inf]
[2024-05-31 22:16:25] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:16:25] [INFO ] Invariant cache hit.
[2024-05-31 22:16:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:16:25] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:16:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:16:25] [INFO ] [Real]Added 75 Read/Feed constraints in 42 ms returned sat
[2024-05-31 22:16:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:16:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:16:26] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:16:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:16:26] [INFO ] Deduced a trap composed of 113 places in 209 ms of which 3 ms to minimize.
[2024-05-31 22:16:26] [INFO ] Deduced a trap composed of 97 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:16:26] [INFO ] Deduced a trap composed of 81 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:16:26] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:16:27] [INFO ] Deduced a trap composed of 71 places in 193 ms of which 2 ms to minimize.
[2024-05-31 22:16:27] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 2 ms to minimize.
[2024-05-31 22:16:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1289 ms
[2024-05-31 22:16:27] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 70 ms.
[2024-05-31 22:16:27] [INFO ] Added : 23 causal constraints over 5 iterations in 301 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[136] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[136] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 47 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-31 22:16:28] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:16:28] [INFO ] Invariant cache hit.
[2024-05-31 22:16:29] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-31 22:16:29] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:16:29] [INFO ] Invariant cache hit.
[2024-05-31 22:16:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:16:30] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
[2024-05-31 22:16:30] [INFO ] Redundant transitions in 20 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-31 22:16:30] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:16:30] [INFO ] Invariant cache hit.
[2024-05-31 22:16:30] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-31 22:16:45] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:16:48] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/430 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34367ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34377ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36030 ms. Remains : 425/425 places, 1232/1232 transitions.
[2024-05-31 22:17:04] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[136] Max Struct:[+inf]
[2024-05-31 22:17:05] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[136] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2104 ms. (475 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 770 ms. (1297 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[136] Max Struct:[+inf]
[2024-05-31 22:17:07] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:07] [INFO ] Invariant cache hit.
[2024-05-31 22:17:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:17:08] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:17:08] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:17:08] [INFO ] [Real]Added 75 Read/Feed constraints in 47 ms returned sat
[2024-05-31 22:17:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:17:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:17:08] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-31 22:17:08] [INFO ] [Nat]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:17:08] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:17:08] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 2 ms to minimize.
[2024-05-31 22:17:09] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:17:09] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:17:09] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:17:09] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:17:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1219 ms
[2024-05-31 22:17:09] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 58 ms.
[2024-05-31 22:17:09] [INFO ] Added : 23 causal constraints over 5 iterations in 275 ms. Result :sat
Minimization took 247 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[136] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[136] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 41 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 41 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-31 22:17:11] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:11] [INFO ] Invariant cache hit.
[2024-05-31 22:17:11] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-31 22:17:11] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:11] [INFO ] Invariant cache hit.
[2024-05-31 22:17:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:17:12] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2024-05-31 22:17:12] [INFO ] Redundant transitions in 19 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-31 22:17:12] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:12] [INFO ] Invariant cache hit.
[2024-05-31 22:17:12] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 2 ms to minimize.
[2024-05-31 22:17:29] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/430 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 33704ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 33714ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35342 ms. Remains : 425/425 places, 1232/1232 transitions.
[2024-05-31 22:17:46] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[136] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502638 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502638 steps, saw 311012 distinct states, run finished after 3002 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-31 22:17:49] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:49] [INFO ] Invariant cache hit.
[2024-05-31 22:17:49] [INFO ] State equation strengthened by 75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 689ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 868 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 48 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 425/425 places, 1232/1232 transitions.
RANDOM walk for 40009 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505609 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505609 steps, saw 312851 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-31 22:17:54] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:54] [INFO ] Invariant cache hit.
[2024-05-31 22:17:54] [INFO ] State equation strengthened by 75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 675ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 856 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 45 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-31 22:17:55] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:55] [INFO ] Invariant cache hit.
[2024-05-31 22:17:56] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-31 22:17:56] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:56] [INFO ] Invariant cache hit.
[2024-05-31 22:17:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:17:57] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
[2024-05-31 22:17:57] [INFO ] Redundant transitions in 20 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-31 22:17:57] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-31 22:17:57] [INFO ] Invariant cache hit.
[2024-05-31 22:17:57] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-31 22:18:12] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 3 ms to minimize.
[2024-05-31 22:18:15] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/430 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34181ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34192ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35843 ms. Remains : 425/425 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 425 transition count 686
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 555 place count 416 transition count 686
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 555 place count 416 transition count 613
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 701 place count 343 transition count 613
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 961 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 149 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 149 transition count 353
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 86 transition count 227
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 86 transition count 227
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 23 transition count 101
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 23 transition count 101
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 23 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 23 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1408 place count 22 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 21 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1415 place count 20 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1416 place count 19 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 1417 place count 19 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1419 place count 19 transition count 31
Applied a total of 1419 rules in 26 ms. Remains 19 /425 variables (removed 406) and now considering 31/1232 (removed 1201) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 22:18:31] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 22:18:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:18:31] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:18:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:18:31] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:18:31] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:18:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:18:31] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:18:31] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:18:31] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:18:31] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 108 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[136] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-09 in 131048 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-10
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-31 22:18:31] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-31 22:18:31] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:18:31] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:18:31] [INFO ] Invariant cache hit.
[2024-05-31 22:18:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:32] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:18:32] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:18:32] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2024-05-31 22:18:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-31 22:18:32] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 22:18:32] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:18:32] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:18:32] [INFO ] Added : 1 causal constraints over 1 iterations in 150 ms. Result :sat
Minimization took 264 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 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 447 transition count 1276
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 447 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 447 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 442 transition count 1262
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 442 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 437 transition count 1250
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 432 transition count 1238
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 432 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 73 place count 427 transition count 1228
Iterating global reduction 3 with 5 rules applied. Total rules applied 78 place count 427 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 423 transition count 1220
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 423 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 419 transition count 1212
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 417 transition count 1208
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 417 transition count 1208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 415 transition count 1204
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 414 transition count 1202
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 414 transition count 1202
Applied a total of 104 rules in 133 ms. Remains 414 /462 variables (removed 48) and now considering 1202/1313 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 414/462 places, 1202/1313 transitions.
[2024-05-31 22:18:33] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:18:33] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2024-05-31 22:18:33] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2089 ms. (478 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 794 ms. (1257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1648] Max Struct:[+inf]
[2024-05-31 22:18:36] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:18:36] [INFO ] Invariant cache hit.
[2024-05-31 22:18:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:36] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 22:18:36] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:18:36] [INFO ] [Real]Added 74 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:18:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:36] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-31 22:18:36] [INFO ] [Nat]Added 74 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:18:36] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-31 22:18:36] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 57 ms.
[2024-05-31 22:18:37] [INFO ] Added : 7 causal constraints over 4 iterations in 265 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1648] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1648] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 39 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 39 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-31 22:18:40] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:18:40] [INFO ] Invariant cache hit.
[2024-05-31 22:18:41] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-31 22:18:41] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:18:41] [INFO ] Invariant cache hit.
[2024-05-31 22:18:41] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:18:42] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1559 ms to find 0 implicit places.
[2024-05-31 22:18:42] [INFO ] Redundant transitions in 16 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-31 22:18:42] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:18:42] [INFO ] Invariant cache hit.
[2024-05-31 22:18:42] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 2 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 33761ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 33772ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35392 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-31 22:19:16] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[1648] Max Struct:[+inf]
[2024-05-31 22:19:16] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:19:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1648] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2064 ms. (484 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 723 ms. (1381 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1648] Max Struct:[+inf]
[2024-05-31 22:19:19] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:19:19] [INFO ] Invariant cache hit.
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-31 22:19:19] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:19:19] [INFO ] [Real]Added 74 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Nat]Added 74 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:19:19] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:19:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2024-05-31 22:19:19] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 56 ms.
[2024-05-31 22:19:20] [INFO ] Added : 7 causal constraints over 4 iterations in 263 ms. Result :sat
Minimization took 237 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1648] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1648] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 38 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 39 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-31 22:19:23] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:19:23] [INFO ] Invariant cache hit.
[2024-05-31 22:19:24] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-31 22:19:24] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:19:24] [INFO ] Invariant cache hit.
[2024-05-31 22:19:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:19:25] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2024-05-31 22:19:25] [INFO ] Redundant transitions in 17 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-31 22:19:25] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:19:25] [INFO ] Invariant cache hit.
[2024-05-31 22:19:25] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-31 22:19:38] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 3 ms to minimize.
[2024-05-31 22:19:38] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 33597ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 33610ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35222 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-31 22:19:58] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[1648] Max Struct:[+inf]
RANDOM walk for 40012 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 546260 steps, run timeout after 3007 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 546260 steps, saw 334960 distinct states, run finished after 3007 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-31 22:20:02] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:20:02] [INFO ] Invariant cache hit.
[2024-05-31 22:20:02] [INFO ] State equation strengthened by 74 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3132 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 45 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 414/414 places, 1202/1202 transitions.
RANDOM walk for 40001 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505822 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505822 steps, saw 310166 distinct states, run finished after 3002 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-31 22:20:09] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:20:09] [INFO ] Invariant cache hit.
[2024-05-31 22:20:09] [INFO ] State equation strengthened by 74 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3112 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 48 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 47 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-31 22:20:13] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:20:13] [INFO ] Invariant cache hit.
[2024-05-31 22:20:13] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-31 22:20:13] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:20:13] [INFO ] Invariant cache hit.
[2024-05-31 22:20:13] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:20:14] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2024-05-31 22:20:14] [INFO ] Redundant transitions in 19 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-31 22:20:14] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:20:14] [INFO ] Invariant cache hit.
[2024-05-31 22:20:14] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-31 22:20:27] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 2 ms to minimize.
[2024-05-31 22:20:28] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 33859ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 33869ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35537 ms. Remains : 414/414 places, 1202/1202 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 534 rules applied. Total rules applied 534 place count 414 transition count 668
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 544 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 544 place count 404 transition count 600
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 680 place count 336 transition count 600
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 208 transition count 472
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 144 transition count 344
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 144 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 144 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 144 transition count 342
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1067 place count 143 transition count 342
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 80 transition count 216
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 80 transition count 216
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1256 place count 17 transition count 90
Iterating global reduction 3 with 63 rules applied. Total rules applied 1319 place count 17 transition count 90
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1382 place count 17 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1382 place count 17 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1384 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 16 transition count 24
Applied a total of 1386 rules in 33 ms. Remains 16 /414 variables (removed 398) and now considering 24/1202 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 16 cols
[2024-05-31 22:20:48] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 22:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:20:48] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:20:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:20:48] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:20:48] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:20:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:20:48] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:20:48] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:20:48] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:20:48] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 110 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1648] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-10 in 136779 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-11
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-31 22:20:48] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-31 22:20:48] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:20:48] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:20:48] [INFO ] Invariant cache hit.
[2024-05-31 22:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:20:48] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 22:20:48] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:20:48] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:20:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:20:49] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:20:49] [INFO ] [Nat]Added 94 Read/Feed constraints in 49 ms returned sat
[2024-05-31 22:20:49] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-31 22:20:49] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 282 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 455 transition count 1299
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 455 transition count 1299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 455 transition count 1295
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 449 transition count 1279
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 449 transition count 1279
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 449 transition count 1275
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 444 transition count 1265
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 444 transition count 1265
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 439 transition count 1253
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 439 transition count 1253
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 434 transition count 1241
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 434 transition count 1241
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 429 transition count 1231
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 429 transition count 1231
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 425 transition count 1223
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 425 transition count 1223
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 421 transition count 1215
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 421 transition count 1215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 419 transition count 1211
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 419 transition count 1211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 417 transition count 1207
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 416 transition count 1205
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 416 transition count 1205
Applied a total of 100 rules in 134 ms. Remains 416 /462 variables (removed 46) and now considering 1205/1313 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 416/462 places, 1205/1313 transitions.
[2024-05-31 22:20:49] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2024-05-31 22:20:50] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2024-05-31 22:20:50] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 2153 ms. (464 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 759 ms. (1315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-31 22:20:53] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:20:53] [INFO ] Invariant cache hit.
[2024-05-31 22:20:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:20:53] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-31 22:20:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:20:53] [INFO ] [Real]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:20:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:20:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:20:53] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-31 22:20:53] [INFO ] [Nat]Added 75 Read/Feed constraints in 41 ms returned sat
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 2 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 3 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2024-05-31 22:20:54] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 72 ms.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 135 places in 143 ms of which 3 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 3 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2024-05-31 22:20:54] [INFO ] Added : 9 causal constraints over 4 iterations in 692 ms. Result :sat
Minimization took 243 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 43 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-31 22:20:55] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:20:55] [INFO ] Invariant cache hit.
[2024-05-31 22:20:55] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-31 22:20:55] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:20:55] [INFO ] Invariant cache hit.
[2024-05-31 22:20:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:20:56] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
[2024-05-31 22:20:56] [INFO ] Redundant transitions in 19 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-31 22:20:56] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:20:56] [INFO ] Invariant cache hit.
[2024-05-31 22:20:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-31 22:21:10] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:21:10] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/421 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34066ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35604 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-31 22:21:30] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 40006 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 547023 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 547023 steps, saw 335426 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-31 22:21:33] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 22:21:33] [INFO ] Invariant cache hit.
[2024-05-31 22:21:33] [INFO ] State equation strengthened by 75 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:21:34] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 2 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/1096 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 837ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 174 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=87 )
Parikh walk visited 1 properties in 7 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[15] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-11 in 46158 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-12
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-31 22:21:34] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-31 22:21:34] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:21:34] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:21:34] [INFO ] Invariant cache hit.
[2024-05-31 22:21:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:35] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-31 22:21:35] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:21:35] [INFO ] [Real]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-31 22:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:21:35] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 22:21:35] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 133 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-31 22:21:35] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-31 22:21:35] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 447 transition count 1276
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 447 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 447 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 442 transition count 1262
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 442 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 437 transition count 1250
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 432 transition count 1238
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 432 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 73 place count 427 transition count 1228
Iterating global reduction 3 with 5 rules applied. Total rules applied 78 place count 427 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 423 transition count 1220
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 423 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 419 transition count 1212
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 417 transition count 1208
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 417 transition count 1208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 415 transition count 1204
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 414 transition count 1202
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 414 transition count 1202
Applied a total of 104 rules in 136 ms. Remains 414 /462 variables (removed 48) and now considering 1202/1313 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 414/462 places, 1202/1313 transitions.
[2024-05-31 22:21:36] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:21:36] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2024-05-31 22:21:36] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000009 steps (2 resets) in 2115 ms. (472 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 705 ms. (1416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-31 22:21:39] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:21:39] [INFO ] Invariant cache hit.
[2024-05-31 22:21:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:39] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-31 22:21:39] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:21:39] [INFO ] [Real]Added 74 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:21:39] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-31 22:21:39] [INFO ] [Nat]Added 74 Read/Feed constraints in 60 ms returned sat
[2024-05-31 22:21:40] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:21:40] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 2 ms to minimize.
[2024-05-31 22:21:40] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:21:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 591 ms
[2024-05-31 22:21:40] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 57 ms.
[2024-05-31 22:21:40] [INFO ] Added : 7 causal constraints over 4 iterations in 254 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 39 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 39 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-31 22:21:41] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:21:41] [INFO ] Invariant cache hit.
[2024-05-31 22:21:41] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-31 22:21:41] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:21:41] [INFO ] Invariant cache hit.
[2024-05-31 22:21:41] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:21:42] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
[2024-05-31 22:21:42] [INFO ] Redundant transitions in 20 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-31 22:21:42] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:21:42] [INFO ] Invariant cache hit.
[2024-05-31 22:21:42] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-31 22:21:55] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 2 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 33632ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 33641ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35231 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-31 22:22:16] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2024-05-31 22:22:16] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:22:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2201 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 708 ms. (1410 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1729] Max Struct:[+inf]
[2024-05-31 22:22:19] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:22:19] [INFO ] Invariant cache hit.
[2024-05-31 22:22:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:22:19] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-31 22:22:19] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:22:19] [INFO ] [Real]Added 74 Read/Feed constraints in 33 ms returned sat
[2024-05-31 22:22:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:22:19] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-31 22:22:19] [INFO ] [Nat]Added 74 Read/Feed constraints in 25 ms returned sat
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 2 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2024-05-31 22:22:20] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 59 ms.
[2024-05-31 22:22:20] [INFO ] Added : 6 causal constraints over 3 iterations in 228 ms. Result :sat
Minimization took 243 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1729] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1729] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 39 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 39 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-31 22:22:24] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:22:24] [INFO ] Invariant cache hit.
[2024-05-31 22:22:25] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-31 22:22:25] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:22:25] [INFO ] Invariant cache hit.
[2024-05-31 22:22:25] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:22:26] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2024-05-31 22:22:26] [INFO ] Redundant transitions in 22 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-31 22:22:26] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:22:26] [INFO ] Invariant cache hit.
[2024-05-31 22:22:26] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:22:40] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 33763ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 33772ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35389 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-31 22:23:00] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1729] Max Struct:[+inf]
[2024-05-31 22:23:00] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:23:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1729] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 2179 ms. (458 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 715 ms. (1396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1729] Max Struct:[+inf]
[2024-05-31 22:23:03] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:23:03] [INFO ] Invariant cache hit.
[2024-05-31 22:23:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:23:03] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-31 22:23:03] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:23:03] [INFO ] [Real]Added 74 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:23:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:23:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:23:03] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:23:03] [INFO ] [Nat]Added 74 Read/Feed constraints in 27 ms returned sat
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 72 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:23:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2024-05-31 22:23:04] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 59 ms.
[2024-05-31 22:23:04] [INFO ] Added : 6 causal constraints over 3 iterations in 240 ms. Result :sat
Minimization took 297 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1729] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1729] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 41 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 40 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-31 22:23:08] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:23:08] [INFO ] Invariant cache hit.
[2024-05-31 22:23:09] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-31 22:23:09] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:23:09] [INFO ] Invariant cache hit.
[2024-05-31 22:23:09] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:23:10] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
[2024-05-31 22:23:10] [INFO ] Redundant transitions in 22 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-31 22:23:10] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:23:10] [INFO ] Invariant cache hit.
[2024-05-31 22:23:10] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-31 22:23:24] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
[2024-05-31 22:23:24] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 34494ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 34506ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36098 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-31 22:23:44] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1729] Max Struct:[+inf]
RANDOM walk for 40005 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 495487 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 1
Probabilistic random walk after 495487 steps, saw 303827 distinct states, run finished after 3002 ms. (steps per millisecond=165 ) properties seen :0
[2024-05-31 22:23:48] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:23:48] [INFO ] Invariant cache hit.
[2024-05-31 22:23:48] [INFO ] State equation strengthened by 74 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3242 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 48 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 414/414 places, 1202/1202 transitions.
RANDOM walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 532336 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 532336 steps, saw 326422 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-05-31 22:23:55] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:23:55] [INFO ] Invariant cache hit.
[2024-05-31 22:23:55] [INFO ] State equation strengthened by 74 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 689ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3108 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 40 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 48 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-31 22:23:58] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:23:58] [INFO ] Invariant cache hit.
[2024-05-31 22:23:59] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-31 22:23:59] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:23:59] [INFO ] Invariant cache hit.
[2024-05-31 22:23:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 22:24:00] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2024-05-31 22:24:00] [INFO ] Redundant transitions in 15 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-31 22:24:00] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 22:24:00] [INFO ] Invariant cache hit.
[2024-05-31 22:24:00] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-31 22:24:13] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 2 ms to minimize.
[2024-05-31 22:24:14] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 33983ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 33992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35510 ms. Remains : 414/414 places, 1202/1202 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 534 rules applied. Total rules applied 534 place count 414 transition count 668
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 544 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 544 place count 404 transition count 600
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 680 place count 336 transition count 600
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 208 transition count 472
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 144 transition count 344
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 144 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 144 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 144 transition count 342
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1067 place count 143 transition count 342
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 80 transition count 216
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 80 transition count 216
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1256 place count 17 transition count 90
Iterating global reduction 3 with 63 rules applied. Total rules applied 1319 place count 17 transition count 90
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1382 place count 17 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1382 place count 17 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1384 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 16 transition count 24
Applied a total of 1386 rules in 19 ms. Remains 16 /414 variables (removed 398) and now considering 24/1202 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 16 cols
[2024-05-31 22:24:34] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 22:24:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:24:34] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:24:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:24:34] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:24:34] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:24:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:24:34] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:24:34] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:24:34] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:24:34] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 85 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1729] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-12 in 179751 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-14
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-31 22:24:34] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-31 22:24:34] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:24:34] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-31 22:24:34] [INFO ] Invariant cache hit.
[2024-05-31 22:24:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:34] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-31 22:24:34] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 22:24:34] [INFO ] [Real]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:24:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:35] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 22:24:35] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:24:35] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 63 ms.
[2024-05-31 22:24:35] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:24:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2024-05-31 22:24:35] [INFO ] Added : 3 causal constraints over 1 iterations in 450 ms. Result :sat
Minimization took 266 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 448 transition count 1280
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 448 transition count 1280
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 448 transition count 1276
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 444 transition count 1268
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 444 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 48 place count 440 transition count 1258
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 440 transition count 1258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 436 transition count 1248
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 436 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 432 transition count 1240
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 429 transition count 1234
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 426 transition count 1228
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 424 transition count 1224
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 422 transition count 1220
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 421 transition count 1218
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 421 transition count 1218
Applied a total of 90 rules in 133 ms. Remains 421 /462 variables (removed 41) and now considering 1218/1313 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 421/462 places, 1218/1313 transitions.
[2024-05-31 22:24:36] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:24:36] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-31 22:24:36] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 2109 ms. (473 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 707 ms. (1412 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:24:39] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:24:39] [INFO ] Invariant cache hit.
[2024-05-31 22:24:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:39] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-31 22:24:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:24:39] [INFO ] [Real]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:24:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:24:39] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-31 22:24:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-31 22:24:39] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 59 ms.
[2024-05-31 22:24:39] [INFO ] Added : 18 causal constraints over 6 iterations in 344 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:24:40] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:24:40] [INFO ] Invariant cache hit.
[2024-05-31 22:24:40] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-31 22:24:40] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:24:40] [INFO ] Invariant cache hit.
[2024-05-31 22:24:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:24:41] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
[2024-05-31 22:24:41] [INFO ] Redundant transitions in 18 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:24:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:24:41] [INFO ] Invariant cache hit.
[2024-05-31 22:24:41] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:24:54] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 2 ms to minimize.
[2024-05-31 22:24:55] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33593ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33602ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35141 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 22:25:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:25:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:25:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2255 ms. (443 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 778 ms. (1283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 22:25:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:25:18] [INFO ] Invariant cache hit.
[2024-05-31 22:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:25:18] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 22:25:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:25:18] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:25:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:25:19] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 22:25:19] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:25:19] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-31 22:25:19] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 64 ms.
[2024-05-31 22:25:19] [INFO ] Added : 8 causal constraints over 3 iterations in 238 ms. Result :sat
Minimization took 293 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 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:25:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:25:20] [INFO ] Invariant cache hit.
[2024-05-31 22:25:20] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-31 22:25:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:25:20] [INFO ] Invariant cache hit.
[2024-05-31 22:25:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:25:21] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
[2024-05-31 22:25:21] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:25:21] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:25:21] [INFO ] Invariant cache hit.
[2024-05-31 22:25:21] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:25:35] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 2 ms to minimize.
[2024-05-31 22:25:36] [INFO ] Deduced a trap composed of 131 places in 227 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34337ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35947 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 22:25:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-31 22:25:56] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:25:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2152 ms. (464 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 750 ms. (1331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[499] Max Struct:[+inf]
[2024-05-31 22:25:59] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:25:59] [INFO ] Invariant cache hit.
[2024-05-31 22:25:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:25:59] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 22:25:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:25:59] [INFO ] [Real]Added 75 Read/Feed constraints in 63 ms returned sat
[2024-05-31 22:25:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:25:59] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-31 22:25:59] [INFO ] [Nat]Added 75 Read/Feed constraints in 53 ms returned sat
[2024-05-31 22:25:59] [INFO ] Deduced a trap composed of 113 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:26:00] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 2 ms to minimize.
[2024-05-31 22:26:00] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:26:00] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:26:00] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:26:00] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:26:01] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:26:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1374 ms
[2024-05-31 22:26:01] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 59 ms.
[2024-05-31 22:26:01] [INFO ] Added : 11 causal constraints over 3 iterations in 224 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[499] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[499] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:26:01] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:26:01] [INFO ] Invariant cache hit.
[2024-05-31 22:26:01] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-31 22:26:01] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:26:01] [INFO ] Invariant cache hit.
[2024-05-31 22:26:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:26:03] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2024-05-31 22:26:03] [INFO ] Redundant transitions in 20 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:26:03] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:26:03] [INFO ] Invariant cache hit.
[2024-05-31 22:26:03] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:26:16] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 2 ms to minimize.
[2024-05-31 22:26:17] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33762ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33771ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35322 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 22:26:36] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[499] Max Struct:[+inf]
[2024-05-31 22:26:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:26:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[499] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2103 ms. (475 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 750 ms. (1331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[556] Max Struct:[+inf]
[2024-05-31 22:26:40] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:26:40] [INFO ] Invariant cache hit.
[2024-05-31 22:26:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:26:40] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-31 22:26:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:26:40] [INFO ] [Real]Added 75 Read/Feed constraints in 62 ms returned sat
[2024-05-31 22:26:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:26:40] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-31 22:26:40] [INFO ] [Nat]Added 75 Read/Feed constraints in 44 ms returned sat
[2024-05-31 22:26:40] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:26:40] [INFO ] Deduced a trap composed of 109 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:26:41] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 2 ms to minimize.
[2024-05-31 22:26:41] [INFO ] Deduced a trap composed of 85 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:26:41] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:26:41] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:26:41] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:26:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1373 ms
[2024-05-31 22:26:42] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 59 ms.
[2024-05-31 22:26:42] [INFO ] Added : 11 causal constraints over 3 iterations in 236 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[556] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[556] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:26:42] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:26:42] [INFO ] Invariant cache hit.
[2024-05-31 22:26:42] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-31 22:26:42] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:26:42] [INFO ] Invariant cache hit.
[2024-05-31 22:26:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:26:44] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
[2024-05-31 22:26:44] [INFO ] Redundant transitions in 21 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:26:44] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:26:44] [INFO ] Invariant cache hit.
[2024-05-31 22:26:44] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:26:57] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 2 ms to minimize.
[2024-05-31 22:26:58] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33789ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35408 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 22:27:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[556] Max Struct:[+inf]
[2024-05-31 22:27:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:27:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[556] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2109 ms. (473 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 717 ms. (1392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[556] Max Struct:[+inf]
[2024-05-31 22:27:21] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:27:21] [INFO ] Invariant cache hit.
[2024-05-31 22:27:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:21] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 22:27:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:27:21] [INFO ] [Real]Added 75 Read/Feed constraints in 69 ms returned sat
[2024-05-31 22:27:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:27:21] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-31 22:27:21] [INFO ] [Nat]Added 75 Read/Feed constraints in 45 ms returned sat
[2024-05-31 22:27:21] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 2 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 109 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 85 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 2 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:27:23] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 2 ms to minimize.
[2024-05-31 22:27:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1486 ms
[2024-05-31 22:27:23] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 70 ms.
[2024-05-31 22:27:23] [INFO ] Added : 11 causal constraints over 3 iterations in 242 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[556] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[556] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:27:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:27:23] [INFO ] Invariant cache hit.
[2024-05-31 22:27:24] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-31 22:27:24] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:27:24] [INFO ] Invariant cache hit.
[2024-05-31 22:27:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:27:25] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2024-05-31 22:27:25] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:27:25] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:27:25] [INFO ] Invariant cache hit.
[2024-05-31 22:27:25] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:27:38] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:27:39] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33938ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35526 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 22:27:59] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[556] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 511993 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 511993 steps, saw 313948 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-31 22:28:02] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:28:02] [INFO ] Invariant cache hit.
[2024-05-31 22:28:02] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 644ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3031 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 47 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 543407 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 543407 steps, saw 333209 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-31 22:28:09] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:28:09] [INFO ] Invariant cache hit.
[2024-05-31 22:28:09] [INFO ] State equation strengthened by 75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 533ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2910 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:28:12] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:28:12] [INFO ] Invariant cache hit.
[2024-05-31 22:28:13] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-31 22:28:13] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:28:13] [INFO ] Invariant cache hit.
[2024-05-31 22:28:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:28:14] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2024-05-31 22:28:14] [INFO ] Redundant transitions in 16 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:28:14] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:28:14] [INFO ] Invariant cache hit.
[2024-05-31 22:28:14] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:28:27] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:28:27] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33563ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35170 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 19 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 22:28:47] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 22:28:47] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:28:48] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:28:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:28:48] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:28:48] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:28:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:28:48] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:28:48] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:28:48] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:28:48] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 94 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[556] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-14 in 253502 ms.
[2024-05-31 22:28:48] [INFO ] Flatten gal took : 146 ms
[2024-05-31 22:28:48] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 22:28:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 462 places, 1313 transitions and 5380 arcs took 10 ms.
Total runtime 1916207 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FunctionPointer-PT-c016-UpperBounds-02
Could not compute solution for formula : FunctionPointer-PT-c016-UpperBounds-05
Could not compute solution for formula : FunctionPointer-PT-c016-UpperBounds-08
Could not compute solution for formula : FunctionPointer-PT-c016-UpperBounds-09
Could not compute solution for formula : FunctionPointer-PT-c016-UpperBounds-10
Could not compute solution for formula : FunctionPointer-PT-c016-UpperBounds-11
Could not compute solution for formula : FunctionPointer-PT-c016-UpperBounds-12
Could not compute solution for formula : FunctionPointer-PT-c016-UpperBounds-14
BK_STOP 1717194528724
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
ub formula name FunctionPointer-PT-c016-UpperBounds-02
ub formula formula --maxsum=/tmp/2553/ub_0_
ub formula name FunctionPointer-PT-c016-UpperBounds-05
ub formula formula --maxsum=/tmp/2553/ub_1_
ub formula name FunctionPointer-PT-c016-UpperBounds-08
ub formula formula --maxsum=/tmp/2553/ub_2_
ub formula name FunctionPointer-PT-c016-UpperBounds-09
ub formula formula --maxsum=/tmp/2553/ub_3_
ub formula name FunctionPointer-PT-c016-UpperBounds-10
ub formula formula --maxsum=/tmp/2553/ub_4_
ub formula name FunctionPointer-PT-c016-UpperBounds-11
ub formula formula --maxsum=/tmp/2553/ub_5_
ub formula name FunctionPointer-PT-c016-UpperBounds-12
ub formula formula --maxsum=/tmp/2553/ub_6_
ub formula name FunctionPointer-PT-c016-UpperBounds-14
ub formula formula --maxsum=/tmp/2553/ub_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="FunctionPointer-PT-c016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FunctionPointer-PT-c016, 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 r496-tall-171640603100301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 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 ;