About the Execution of GreatSPN+red for FunctionPointer-PT-c128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5862.319 | 3158383.00 | 4317177.00 | 6616.60 | 0 ? ? 0 ? ? 0 ? 0 ? ? 0 0 ? 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.r179-tall-171640601300325.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FunctionPointer-PT-c128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601300325
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 16:20 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-c128-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716449894267
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 07:38:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 07:38:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:38:15] [INFO ] Load time of PNML (sax parser for PT used): 395 ms
[2024-05-23 07:38:15] [INFO ] Transformed 2826 places.
[2024-05-23 07:38:15] [INFO ] Transformed 8960 transitions.
[2024-05-23 07:38:16] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 555 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-c128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 07:38:16] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 07:38:16] [INFO ] Computed 4 invariants in 96 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
RANDOM walk for 10037 steps (2 resets) in 123 ms. (80 steps per ms)
BEST_FIRST walk for 90009 steps (29 resets) in 222 ms. (403 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 8, 0, 0, 0, 2, 0, 0, 8] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:38:16] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-23 07:38:16] [INFO ] Invariant cache hit.
[2024-05-23 07:38:16] [INFO ] [Real]Absence check using 3 positive place invariants in 24 ms returned sat
[2024-05-23 07:38:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:17] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2024-05-23 07:38:17] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-23 07:38:18] [INFO ] [Real]Added 479 Read/Feed constraints in 119 ms returned sat
[2024-05-23 07:38:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:38:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 07:38:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:19] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2024-05-23 07:38:19] [INFO ] [Nat]Added 479 Read/Feed constraints in 110 ms returned sat
[2024-05-23 07:38:20] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 715 ms.
[2024-05-23 07:38:21] [INFO ] Deduced a trap composed of 142 places in 1326 ms of which 101 ms to minimize.
[2024-05-23 07:38:23] [INFO ] Deduced a trap composed of 139 places in 1151 ms of which 11 ms to minimize.
[2024-05-23 07:38:24] [INFO ] Deduced a trap composed of 134 places in 1244 ms of which 12 ms to minimize.
[2024-05-23 07:38:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-23 07:38:24] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 07:38:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:25] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2024-05-23 07:38:25] [INFO ] [Real]Added 479 Read/Feed constraints in 155 ms returned sat
[2024-05-23 07:38:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:38:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 07:38:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 07:38:26] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2024-05-23 07:38:26] [INFO ] [Nat]Added 479 Read/Feed constraints in 199 ms returned sat
[2024-05-23 07:38:28] [INFO ] Deduced a trap composed of 134 places in 1126 ms of which 11 ms to minimize.
[2024-05-23 07:38:29] [INFO ] Deduced a trap composed of 147 places in 1174 ms of which 10 ms to minimize.
[2024-05-23 07:38:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2605 ms
[2024-05-23 07:38:29] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 432 ms.
[2024-05-23 07:38:30] [INFO ] Added : 2 causal constraints over 1 iterations in 736 ms. Result :sat
Minimization took 491 ms.
[2024-05-23 07:38:30] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 07:38:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:31] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2024-05-23 07:38:31] [INFO ] [Real]Added 479 Read/Feed constraints in 172 ms returned sat
[2024-05-23 07:38:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:38:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 07:38:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:32] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2024-05-23 07:38:33] [INFO ] [Nat]Added 479 Read/Feed constraints in 110 ms returned sat
[2024-05-23 07:38:33] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 404 ms.
[2024-05-23 07:38:33] [INFO ] Added : 2 causal constraints over 1 iterations in 738 ms. Result :sat
Minimization took 579 ms.
[2024-05-23 07:38:34] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 07:38:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:35] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2024-05-23 07:38:35] [INFO ] [Real]Added 479 Read/Feed constraints in 181 ms returned sat
[2024-05-23 07:38:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:38:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 07:38:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:36] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2024-05-23 07:38:36] [INFO ] [Nat]Added 479 Read/Feed constraints in 129 ms returned sat
[2024-05-23 07:38:37] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 697 ms.
[2024-05-23 07:38:39] [INFO ] Deduced a trap composed of 142 places in 1135 ms of which 10 ms to minimize.
[2024-05-23 07:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1337 ms
[2024-05-23 07:38:39] [INFO ] Added : 2 causal constraints over 1 iterations in 2459 ms. Result :sat
Minimization took 576 ms.
[2024-05-23 07:38:40] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 07:38:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:40] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2024-05-23 07:38:41] [INFO ] [Real]Added 479 Read/Feed constraints in 180 ms returned sat
[2024-05-23 07:38:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:38:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2024-05-23 07:38:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:42] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2024-05-23 07:38:42] [INFO ] [Nat]Added 479 Read/Feed constraints in 97 ms returned sat
[2024-05-23 07:38:42] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 419 ms.
[2024-05-23 07:38:44] [INFO ] Deduced a trap composed of 142 places in 1112 ms of which 11 ms to minimize.
[2024-05-23 07:38:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1335 ms
[2024-05-23 07:38:44] [INFO ] Added : 2 causal constraints over 1 iterations in 2167 ms. Result :sat
Minimization took 577 ms.
[2024-05-23 07:38:45] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 07:38:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 07:38:46] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2024-05-23 07:38:46] [INFO ] [Real]Added 479 Read/Feed constraints in 180 ms returned sat
[2024-05-23 07:38:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:38:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 07:38:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 07:38:47] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2024-05-23 07:38:47] [INFO ] [Nat]Added 479 Read/Feed constraints in 130 ms returned sat
[2024-05-23 07:38:48] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 396 ms.
[2024-05-23 07:38:48] [INFO ] Added : 1 causal constraints over 1 iterations in 712 ms. Result :sat
Minimization took 576 ms.
[2024-05-23 07:38:49] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 07:38:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:50] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2024-05-23 07:38:50] [INFO ] [Real]Added 479 Read/Feed constraints in 194 ms returned sat
[2024-05-23 07:38:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:38:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 07:38:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:51] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2024-05-23 07:38:51] [INFO ] [Nat]Added 479 Read/Feed constraints in 124 ms returned sat
[2024-05-23 07:38:51] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 402 ms.
[2024-05-23 07:38:52] [INFO ] Added : 1 causal constraints over 1 iterations in 715 ms. Result :sat
Minimization took 577 ms.
[2024-05-23 07:38:52] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 07:38:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 07:38:53] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2024-05-23 07:38:53] [INFO ] [Real]Added 479 Read/Feed constraints in 177 ms returned sat
[2024-05-23 07:38:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:38:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 07:38:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:54] [INFO ] [Nat]Absence check using state equation in 710 ms returned sat
[2024-05-23 07:38:54] [INFO ] [Nat]Added 479 Read/Feed constraints in 86 ms returned sat
[2024-05-23 07:38:55] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 388 ms.
[2024-05-23 07:38:56] [INFO ] Deduced a trap composed of 142 places in 1120 ms of which 10 ms to minimize.
[2024-05-23 07:38:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1326 ms
[2024-05-23 07:38:57] [INFO ] Added : 2 causal constraints over 1 iterations in 2114 ms. Result :sat
Minimization took 579 ms.
[2024-05-23 07:38:57] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-23 07:38:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 07:38:58] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2024-05-23 07:38:58] [INFO ] [Real]Added 479 Read/Feed constraints in 141 ms returned sat
[2024-05-23 07:38:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:38:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 07:38:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 07:38:59] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2024-05-23 07:39:00] [INFO ] [Nat]Added 479 Read/Feed constraints in 259 ms returned sat
[2024-05-23 07:39:00] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 391 ms.
[2024-05-23 07:39:00] [INFO ] Added : 3 causal constraints over 1 iterations in 712 ms. Result :sat
Minimization took 580 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 8, 0, 0, 0, 2, 0, 0, 8] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 8, 0, 0, 0, 2, 0, 0, 8] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Support contains 9 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 1419 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.12 ms
Discarding 209 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 1419 transition count 5578
Discarding 296 places :
Symmetric choice reduction at 1 with 296 rule applications. Total rules 681 place count 1123 transition count 3334
Iterating global reduction 1 with 296 rules applied. Total rules applied 977 place count 1123 transition count 3334
Ensure Unique test removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 1 with 378 rules applied. Total rules applied 1355 place count 1123 transition count 2956
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1510 place count 968 transition count 2646
Iterating global reduction 2 with 155 rules applied. Total rules applied 1665 place count 968 transition count 2646
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 1741 place count 968 transition count 2570
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1755 place count 954 transition count 2542
Iterating global reduction 3 with 14 rules applied. Total rules applied 1769 place count 954 transition count 2542
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1783 place count 940 transition count 2514
Iterating global reduction 3 with 14 rules applied. Total rules applied 1797 place count 940 transition count 2514
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1811 place count 926 transition count 2486
Iterating global reduction 3 with 14 rules applied. Total rules applied 1825 place count 926 transition count 2486
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1838 place count 913 transition count 2460
Iterating global reduction 3 with 13 rules applied. Total rules applied 1851 place count 913 transition count 2460
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1864 place count 900 transition count 2434
Iterating global reduction 3 with 13 rules applied. Total rules applied 1877 place count 900 transition count 2434
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1889 place count 888 transition count 2410
Iterating global reduction 3 with 12 rules applied. Total rules applied 1901 place count 888 transition count 2410
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1913 place count 876 transition count 2386
Iterating global reduction 3 with 12 rules applied. Total rules applied 1925 place count 876 transition count 2386
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1969 place count 832 transition count 2224
Iterating global reduction 3 with 44 rules applied. Total rules applied 2013 place count 832 transition count 2224
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2071 place count 774 transition count 1992
Iterating global reduction 3 with 58 rules applied. Total rules applied 2129 place count 774 transition count 1992
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2187 place count 716 transition count 1834
Iterating global reduction 3 with 58 rules applied. Total rules applied 2245 place count 716 transition count 1834
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2303 place count 658 transition count 1718
Iterating global reduction 3 with 58 rules applied. Total rules applied 2361 place count 658 transition count 1718
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2418 place count 601 transition count 1604
Iterating global reduction 3 with 57 rules applied. Total rules applied 2475 place count 601 transition count 1604
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2532 place count 544 transition count 1490
Iterating global reduction 3 with 57 rules applied. Total rules applied 2589 place count 544 transition count 1490
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2645 place count 488 transition count 1378
Iterating global reduction 3 with 56 rules applied. Total rules applied 2701 place count 488 transition count 1378
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2722 place count 467 transition count 1336
Iterating global reduction 3 with 21 rules applied. Total rules applied 2743 place count 467 transition count 1336
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 2755 place count 467 transition count 1324
Applied a total of 2755 rules in 1114 ms. Remains 467 /1628 variables (removed 1161) and now considering 1324/5962 (removed 4638) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1127 ms. Remains : 467/1628 places, 1324/5962 transitions.
[2024-05-23 07:39:02] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
Found an invariant !
This invariant on transitions {204=1, 340=1, 671=1, 757=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {202=1, 338=1, 541=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 9) seen :[2, 2, 3, 1, 1, 2, 2, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 8, 3, 1, 1, 2, 2, 1, 8] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:39:03] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
// Phase 1: matrix 762 rows 467 cols
[2024-05-23 07:39:03] [INFO ] Computed 3 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 8, 3, 1, 1, 2, 2, 1, 8] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
RANDOM walk for 1000000 steps (2 resets) in 2383 ms. (419 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 14718 ms. (611 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[26, 8, 31, 26, 19, 61, 282, 25, 8] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:39:20] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:39:20] [INFO ] Invariant cache hit.
[2024-05-23 07:39:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:39:20] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 07:39:20] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:39:20] [INFO ] [Real]Added 91 Read/Feed constraints in 44 ms returned sat
[2024-05-23 07:39:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:39:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:39:20] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 07:39:20] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 07:39:20] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 73 ms.
[2024-05-23 07:39:21] [INFO ] Added : 15 causal constraints over 5 iterations in 305 ms. Result :sat
Minimization took 276 ms.
[2024-05-23 07:39:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:21] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 07:39:21] [INFO ] [Real]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 07:39:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:39:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:39:21] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 07:39:22] [INFO ] [Nat]Added 91 Read/Feed constraints in 32 ms returned sat
[2024-05-23 07:39:22] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 65 ms.
[2024-05-23 07:39:22] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 268 ms.
[2024-05-23 07:39:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:22] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-23 07:39:22] [INFO ] [Real]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 07:39:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:39:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:22] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 07:39:23] [INFO ] [Nat]Added 91 Read/Feed constraints in 31 ms returned sat
[2024-05-23 07:39:23] [INFO ] Deduced a trap composed of 145 places in 198 ms of which 3 ms to minimize.
[2024-05-23 07:39:23] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 3 ms to minimize.
[2024-05-23 07:39:23] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 3 ms to minimize.
[2024-05-23 07:39:23] [INFO ] Deduced a trap composed of 126 places in 207 ms of which 3 ms to minimize.
[2024-05-23 07:39:24] [INFO ] Deduced a trap composed of 118 places in 208 ms of which 4 ms to minimize.
[2024-05-23 07:39:24] [INFO ] Deduced a trap composed of 146 places in 213 ms of which 3 ms to minimize.
[2024-05-23 07:39:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1408 ms
[2024-05-23 07:39:24] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 72 ms.
[2024-05-23 07:39:24] [INFO ] Added : 5 causal constraints over 3 iterations in 238 ms. Result :sat
Minimization took 272 ms.
[2024-05-23 07:39:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:25] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 07:39:25] [INFO ] [Real]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 07:39:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:39:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:25] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-23 07:39:25] [INFO ] [Nat]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-23 07:39:25] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:39:25] [INFO ] Added : 5 causal constraints over 3 iterations in 230 ms. Result :sat
Minimization took 264 ms.
[2024-05-23 07:39:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:26] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:39:26] [INFO ] [Real]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 07:39:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:39:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:26] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 07:39:26] [INFO ] [Nat]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 07:39:26] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 84 ms.
[2024-05-23 07:39:26] [INFO ] Added : 9 causal constraints over 3 iterations in 254 ms. Result :sat
Minimization took 273 ms.
[2024-05-23 07:39:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:39:27] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 07:39:27] [INFO ] [Real]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-23 07:39:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:39:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:39:27] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 07:39:27] [INFO ] [Nat]Added 91 Read/Feed constraints in 72 ms returned sat
[2024-05-23 07:39:27] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 88 ms.
[2024-05-23 07:39:28] [INFO ] Added : 1 causal constraints over 1 iterations in 187 ms. Result :sat
Minimization took 270 ms.
[2024-05-23 07:39:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:39:28] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 07:39:28] [INFO ] [Real]Added 91 Read/Feed constraints in 46 ms returned sat
[2024-05-23 07:39:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:39:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:28] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 07:39:28] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 07:39:29] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 79 ms.
[2024-05-23 07:39:29] [INFO ] Added : 1 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 266 ms.
[2024-05-23 07:39:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:39:29] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 07:39:29] [INFO ] [Real]Added 91 Read/Feed constraints in 50 ms returned sat
[2024-05-23 07:39:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:39:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:29] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 07:39:29] [INFO ] [Nat]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 07:39:30] [INFO ] Deduced a trap composed of 145 places in 198 ms of which 4 ms to minimize.
[2024-05-23 07:39:30] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 3 ms to minimize.
[2024-05-23 07:39:30] [INFO ] Deduced a trap composed of 126 places in 191 ms of which 3 ms to minimize.
[2024-05-23 07:39:30] [INFO ] Deduced a trap composed of 121 places in 191 ms of which 4 ms to minimize.
[2024-05-23 07:39:31] [INFO ] Deduced a trap composed of 119 places in 189 ms of which 3 ms to minimize.
[2024-05-23 07:39:31] [INFO ] Deduced a trap composed of 118 places in 199 ms of which 3 ms to minimize.
[2024-05-23 07:39:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1330 ms
[2024-05-23 07:39:31] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 72 ms.
[2024-05-23 07:39:31] [INFO ] Added : 5 causal constraints over 3 iterations in 247 ms. Result :sat
Minimization took 324 ms.
[2024-05-23 07:39:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:32] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 07:39:32] [INFO ] [Real]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:39:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:39:32] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 07:39:32] [INFO ] [Nat]Added 91 Read/Feed constraints in 31 ms returned sat
[2024-05-23 07:39:32] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:39:32] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 273 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[26, 8, 31, 26, 19, 61, 282, 25, 8] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[26, 126, 31, 26, 19, 61, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Support contains 9 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 57 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 467/467 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 59 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-23 07:39:34] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:39:34] [INFO ] Invariant cache hit.
[2024-05-23 07:39:34] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-23 07:39:34] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:39:34] [INFO ] Invariant cache hit.
[2024-05-23 07:39:34] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:39:35] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
[2024-05-23 07:39:36] [INFO ] Redundant transitions in 79 ms returned []
Running 1322 sub problems to find dead transitions.
[2024-05-23 07:39:36] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:39:36] [INFO ] Invariant cache hit.
[2024-05-23 07:39:36] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1229/1229 variables, and 561 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 1322/1883 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1229/1229 variables, and 1883 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
After SMT, in 64888ms problems are : Problem set: 0 solved, 1322 unsolved
Search for dead transitions found 0 dead transitions in 64914ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66811 ms. Remains : 467/467 places, 1324/1324 transitions.
[2024-05-23 07:40:40] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
Found an invariant !
This invariant on transitions {204=1, 340=1, 671=1, 757=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 338=1, 541=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :[2, 1, 2, 1, 2, 1, 3, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[26, 126, 31, 26, 19, 61, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:40:41] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:40:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[26, 126, 31, 26, 19, 61, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
RANDOM walk for 1000000 steps (2 resets) in 2246 ms. (445 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 14845 ms. (606 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[26, 126, 37, 30, 19, 61, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:40:58] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:40:58] [INFO ] Invariant cache hit.
[2024-05-23 07:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:40:58] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 07:40:58] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:40:58] [INFO ] [Real]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 07:40:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:40:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:40:58] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 07:40:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 07:40:59] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:40:59] [INFO ] Added : 15 causal constraints over 5 iterations in 294 ms. Result :sat
Minimization took 266 ms.
[2024-05-23 07:40:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:40:59] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 07:40:59] [INFO ] [Real]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 07:40:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:40:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:41:00] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-23 07:41:00] [INFO ] [Nat]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 07:41:00] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:41:00] [INFO ] Added : 1 causal constraints over 1 iterations in 151 ms. Result :sat
Minimization took 264 ms.
[2024-05-23 07:41:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:00] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 07:41:00] [INFO ] [Real]Added 91 Read/Feed constraints in 45 ms returned sat
[2024-05-23 07:41:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:41:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:41:01] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 07:41:01] [INFO ] [Nat]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:41:01] [INFO ] Deduced a trap composed of 145 places in 215 ms of which 3 ms to minimize.
[2024-05-23 07:41:01] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 3 ms to minimize.
[2024-05-23 07:41:01] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-05-23 07:41:02] [INFO ] Deduced a trap composed of 126 places in 211 ms of which 3 ms to minimize.
[2024-05-23 07:41:02] [INFO ] Deduced a trap composed of 118 places in 203 ms of which 3 ms to minimize.
[2024-05-23 07:41:02] [INFO ] Deduced a trap composed of 146 places in 210 ms of which 3 ms to minimize.
[2024-05-23 07:41:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1400 ms
[2024-05-23 07:41:02] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 69 ms.
[2024-05-23 07:41:02] [INFO ] Added : 5 causal constraints over 3 iterations in 249 ms. Result :sat
Minimization took 270 ms.
[2024-05-23 07:41:03] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:03] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:41:03] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 07:41:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:41:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:41:03] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 07:41:03] [INFO ] [Nat]Added 91 Read/Feed constraints in 56 ms returned sat
[2024-05-23 07:41:03] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:41:03] [INFO ] Added : 5 causal constraints over 3 iterations in 230 ms. Result :sat
Minimization took 271 ms.
[2024-05-23 07:41:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:04] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 07:41:04] [INFO ] [Real]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 07:41:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:41:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:04] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 07:41:04] [INFO ] [Nat]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 07:41:04] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 78 ms.
[2024-05-23 07:41:05] [INFO ] Added : 9 causal constraints over 3 iterations in 255 ms. Result :sat
Minimization took 266 ms.
[2024-05-23 07:41:05] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-23 07:41:05] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2024-05-23 07:41:05] [INFO ] [Real]Added 91 Read/Feed constraints in 53 ms returned sat
[2024-05-23 07:41:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:41:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:06] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 07:41:06] [INFO ] [Nat]Added 91 Read/Feed constraints in 61 ms returned sat
[2024-05-23 07:41:06] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:41:06] [INFO ] Added : 1 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 262 ms.
[2024-05-23 07:41:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:06] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:41:06] [INFO ] [Real]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:41:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:41:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:07] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 07:41:07] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 07:41:07] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 72 ms.
[2024-05-23 07:41:07] [INFO ] Added : 1 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 262 ms.
[2024-05-23 07:41:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:41:07] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 07:41:07] [INFO ] [Real]Added 91 Read/Feed constraints in 48 ms returned sat
[2024-05-23 07:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:41:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:08] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 07:41:08] [INFO ] [Nat]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 07:41:08] [INFO ] Deduced a trap composed of 145 places in 198 ms of which 3 ms to minimize.
[2024-05-23 07:41:08] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 3 ms to minimize.
[2024-05-23 07:41:08] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 2 ms to minimize.
[2024-05-23 07:41:09] [INFO ] Deduced a trap composed of 121 places in 195 ms of which 3 ms to minimize.
[2024-05-23 07:41:09] [INFO ] Deduced a trap composed of 119 places in 194 ms of which 3 ms to minimize.
[2024-05-23 07:41:09] [INFO ] Deduced a trap composed of 118 places in 211 ms of which 3 ms to minimize.
[2024-05-23 07:41:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1354 ms
[2024-05-23 07:41:09] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:41:09] [INFO ] Added : 5 causal constraints over 3 iterations in 232 ms. Result :sat
Minimization took 281 ms.
[2024-05-23 07:41:10] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:10] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 07:41:10] [INFO ] [Real]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-23 07:41:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:41:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:41:10] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 07:41:10] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 07:41:10] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 68 ms.
[2024-05-23 07:41:10] [INFO ] Added : 1 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[26, 126, 37, 30, 19, 61, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[26, 126, 37, 30, 19, 61, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Support contains 9 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 51 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 467/467 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 58 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-23 07:41:12] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:41:12] [INFO ] Invariant cache hit.
[2024-05-23 07:41:12] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-23 07:41:12] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:41:12] [INFO ] Invariant cache hit.
[2024-05-23 07:41:12] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:41:14] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2024-05-23 07:41:14] [INFO ] Redundant transitions in 26 ms returned []
Running 1322 sub problems to find dead transitions.
[2024-05-23 07:41:14] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:41:14] [INFO ] Invariant cache hit.
[2024-05-23 07:41:14] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1229/1229 variables, and 561 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 1322/1883 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1229/1229 variables, and 1883 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
After SMT, in 64524ms problems are : Problem set: 0 solved, 1322 unsolved
Search for dead transitions found 0 dead transitions in 64536ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66375 ms. Remains : 467/467 places, 1324/1324 transitions.
[2024-05-23 07:42:18] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
Found an invariant !
This invariant on transitions {204=1, 340=1, 671=1, 757=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 338=1, 541=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :[2, 1, 2, 3, 3, 4, 3, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[26, 126, 37, 30, 19, 61, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:42:18] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:42:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[26, 126, 37, 30, 19, 61, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
RANDOM walk for 1000003 steps (2 resets) in 2313 ms. (432 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 15727 ms. (572 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[26, 126, 37, 30, 19, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:42:37] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:42:37] [INFO ] Invariant cache hit.
[2024-05-23 07:42:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:37] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 07:42:37] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:42:37] [INFO ] [Real]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 07:42:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:42:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:37] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:42:37] [INFO ] [Nat]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 07:42:37] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 64 ms.
[2024-05-23 07:42:37] [INFO ] Added : 15 causal constraints over 5 iterations in 300 ms. Result :sat
Minimization took 276 ms.
[2024-05-23 07:42:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:42:38] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 07:42:38] [INFO ] [Real]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 07:42:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:42:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:38] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 07:42:38] [INFO ] [Nat]Added 91 Read/Feed constraints in 31 ms returned sat
[2024-05-23 07:42:38] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:42:38] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 275 ms.
[2024-05-23 07:42:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:39] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-23 07:42:39] [INFO ] [Real]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-23 07:42:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:42:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:39] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 07:42:39] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-23 07:42:39] [INFO ] Deduced a trap composed of 145 places in 197 ms of which 3 ms to minimize.
[2024-05-23 07:42:40] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 3 ms to minimize.
[2024-05-23 07:42:40] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 3 ms to minimize.
[2024-05-23 07:42:40] [INFO ] Deduced a trap composed of 126 places in 237 ms of which 3 ms to minimize.
[2024-05-23 07:42:40] [INFO ] Deduced a trap composed of 118 places in 195 ms of which 3 ms to minimize.
[2024-05-23 07:42:41] [INFO ] Deduced a trap composed of 146 places in 194 ms of which 3 ms to minimize.
[2024-05-23 07:42:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1374 ms
[2024-05-23 07:42:41] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:42:41] [INFO ] Added : 5 causal constraints over 3 iterations in 222 ms. Result :sat
Minimization took 280 ms.
[2024-05-23 07:42:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:41] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-23 07:42:41] [INFO ] [Real]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 07:42:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:42:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:42:42] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 07:42:42] [INFO ] [Nat]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-23 07:42:42] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 64 ms.
[2024-05-23 07:42:42] [INFO ] Added : 5 causal constraints over 3 iterations in 234 ms. Result :sat
Minimization took 277 ms.
[2024-05-23 07:42:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:42] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-23 07:42:43] [INFO ] [Real]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 07:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:42:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:42:43] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 07:42:43] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 07:42:43] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 64 ms.
[2024-05-23 07:42:43] [INFO ] Added : 9 causal constraints over 3 iterations in 218 ms. Result :sat
Minimization took 266 ms.
[2024-05-23 07:42:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:44] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-23 07:42:44] [INFO ] [Real]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-23 07:42:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:42:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:44] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 07:42:44] [INFO ] [Nat]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-23 07:42:44] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 64 ms.
[2024-05-23 07:42:44] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 261 ms.
[2024-05-23 07:42:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:42:45] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 07:42:45] [INFO ] [Real]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:42:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:42:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:42:45] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 07:42:45] [INFO ] [Nat]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-23 07:42:45] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 64 ms.
[2024-05-23 07:42:45] [INFO ] Added : 1 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 264 ms.
[2024-05-23 07:42:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:46] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 07:42:46] [INFO ] [Real]Added 91 Read/Feed constraints in 45 ms returned sat
[2024-05-23 07:42:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:42:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:42:46] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 07:42:46] [INFO ] [Nat]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-23 07:42:46] [INFO ] Deduced a trap composed of 145 places in 191 ms of which 3 ms to minimize.
[2024-05-23 07:42:46] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 2 ms to minimize.
[2024-05-23 07:42:47] [INFO ] Deduced a trap composed of 126 places in 190 ms of which 3 ms to minimize.
[2024-05-23 07:42:47] [INFO ] Deduced a trap composed of 121 places in 195 ms of which 3 ms to minimize.
[2024-05-23 07:42:47] [INFO ] Deduced a trap composed of 119 places in 186 ms of which 3 ms to minimize.
[2024-05-23 07:42:47] [INFO ] Deduced a trap composed of 118 places in 196 ms of which 3 ms to minimize.
[2024-05-23 07:42:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1326 ms
[2024-05-23 07:42:47] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:42:47] [INFO ] Added : 5 causal constraints over 3 iterations in 245 ms. Result :sat
Minimization took 274 ms.
[2024-05-23 07:42:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:42:48] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 07:42:48] [INFO ] [Real]Added 91 Read/Feed constraints in 32 ms returned sat
[2024-05-23 07:42:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:42:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:42:48] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 07:42:48] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 07:42:48] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 65 ms.
[2024-05-23 07:42:48] [INFO ] Added : 1 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[26, 126, 37, 30, 19, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[26, 126, 37, 30, 19, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Support contains 9 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 54 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 467/467 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 48 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-23 07:42:50] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:42:50] [INFO ] Invariant cache hit.
[2024-05-23 07:42:50] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 07:42:50] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:42:50] [INFO ] Invariant cache hit.
[2024-05-23 07:42:50] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:42:52] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
[2024-05-23 07:42:52] [INFO ] Redundant transitions in 21 ms returned []
Running 1322 sub problems to find dead transitions.
[2024-05-23 07:42:52] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:42:52] [INFO ] Invariant cache hit.
[2024-05-23 07:42:52] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1229/1229 variables, and 561 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 1322/1883 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1229/1229 variables, and 1883 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
After SMT, in 64246ms problems are : Problem set: 0 solved, 1322 unsolved
Search for dead transitions found 0 dead transitions in 64257ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66110 ms. Remains : 467/467 places, 1324/1324 transitions.
[2024-05-23 07:43:56] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
Found an invariant !
This invariant on transitions {204=1, 340=1, 671=1, 757=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 338=1, 541=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :[2, 2, 2, 2, 0, 2, 2, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[26, 126, 37, 30, 19, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:43:56] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:43:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[26, 126, 37, 30, 19, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
RANDOM walk for 1000000 steps (2 resets) in 2211 ms. (452 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 14799 ms. (608 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:44:13] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:44:13] [INFO ] Invariant cache hit.
[2024-05-23 07:44:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:14] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 07:44:14] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:44:14] [INFO ] [Real]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 07:44:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:44:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:14] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 07:44:14] [INFO ] [Nat]Added 91 Read/Feed constraints in 29 ms returned sat
[2024-05-23 07:44:14] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:44:14] [INFO ] Added : 15 causal constraints over 5 iterations in 302 ms. Result :sat
Minimization took 283 ms.
[2024-05-23 07:44:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:44:15] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 07:44:15] [INFO ] [Real]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 07:44:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:44:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:44:15] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 07:44:15] [INFO ] [Nat]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:44:15] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:44:15] [INFO ] Added : 1 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 274 ms.
[2024-05-23 07:44:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:16] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 07:44:16] [INFO ] [Real]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-23 07:44:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:44:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:16] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 07:44:16] [INFO ] [Nat]Added 91 Read/Feed constraints in 32 ms returned sat
[2024-05-23 07:44:16] [INFO ] Deduced a trap composed of 145 places in 197 ms of which 3 ms to minimize.
[2024-05-23 07:44:17] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 3 ms to minimize.
[2024-05-23 07:44:17] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 3 ms to minimize.
[2024-05-23 07:44:17] [INFO ] Deduced a trap composed of 126 places in 196 ms of which 3 ms to minimize.
[2024-05-23 07:44:17] [INFO ] Deduced a trap composed of 118 places in 190 ms of which 3 ms to minimize.
[2024-05-23 07:44:17] [INFO ] Deduced a trap composed of 146 places in 199 ms of which 3 ms to minimize.
[2024-05-23 07:44:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1335 ms
[2024-05-23 07:44:17] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 64 ms.
[2024-05-23 07:44:18] [INFO ] Added : 5 causal constraints over 3 iterations in 219 ms. Result :sat
Minimization took 288 ms.
[2024-05-23 07:44:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:18] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 07:44:18] [INFO ] [Real]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 07:44:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:44:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:18] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 07:44:19] [INFO ] [Nat]Added 91 Read/Feed constraints in 58 ms returned sat
[2024-05-23 07:44:19] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 64 ms.
[2024-05-23 07:44:19] [INFO ] Added : 5 causal constraints over 3 iterations in 227 ms. Result :sat
Minimization took 279 ms.
[2024-05-23 07:44:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:19] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:44:19] [INFO ] [Real]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 07:44:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:44:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:44:20] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 07:44:20] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 07:44:20] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 65 ms.
[2024-05-23 07:44:20] [INFO ] Added : 9 causal constraints over 3 iterations in 225 ms. Result :sat
Minimization took 271 ms.
[2024-05-23 07:44:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:44:20] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 07:44:20] [INFO ] [Real]Added 91 Read/Feed constraints in 59 ms returned sat
[2024-05-23 07:44:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:44:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:44:21] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 07:44:21] [INFO ] [Nat]Added 91 Read/Feed constraints in 64 ms returned sat
[2024-05-23 07:44:21] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:44:21] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 265 ms.
[2024-05-23 07:44:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:21] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 07:44:21] [INFO ] [Real]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 07:44:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:44:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:44:22] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 07:44:22] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 07:44:22] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:44:22] [INFO ] Added : 1 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 270 ms.
[2024-05-23 07:44:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:22] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 07:44:22] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-23 07:44:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:44:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:44:23] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:44:23] [INFO ] [Nat]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-23 07:44:23] [INFO ] Deduced a trap composed of 145 places in 199 ms of which 3 ms to minimize.
[2024-05-23 07:44:23] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 4 ms to minimize.
[2024-05-23 07:44:23] [INFO ] Deduced a trap composed of 126 places in 197 ms of which 3 ms to minimize.
[2024-05-23 07:44:24] [INFO ] Deduced a trap composed of 121 places in 196 ms of which 3 ms to minimize.
[2024-05-23 07:44:24] [INFO ] Deduced a trap composed of 119 places in 203 ms of which 3 ms to minimize.
[2024-05-23 07:44:24] [INFO ] Deduced a trap composed of 118 places in 192 ms of which 3 ms to minimize.
[2024-05-23 07:44:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1329 ms
[2024-05-23 07:44:24] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 65 ms.
[2024-05-23 07:44:24] [INFO ] Added : 5 causal constraints over 3 iterations in 239 ms. Result :sat
Minimization took 283 ms.
[2024-05-23 07:44:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:25] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 07:44:25] [INFO ] [Real]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:44:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:44:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:44:25] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 07:44:25] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 07:44:25] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:44:25] [INFO ] Added : 1 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Support contains 9 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 48 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 467/467 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 48 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-23 07:44:27] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:44:27] [INFO ] Invariant cache hit.
[2024-05-23 07:44:27] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-23 07:44:27] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:44:27] [INFO ] Invariant cache hit.
[2024-05-23 07:44:27] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:44:28] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
[2024-05-23 07:44:28] [INFO ] Redundant transitions in 19 ms returned []
Running 1322 sub problems to find dead transitions.
[2024-05-23 07:44:29] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:44:29] [INFO ] Invariant cache hit.
[2024-05-23 07:44:29] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1229/1229 variables, and 561 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 1322/1883 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1229/1229 variables, and 1883 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
After SMT, in 64531ms problems are : Problem set: 0 solved, 1322 unsolved
Search for dead transitions found 0 dead transitions in 64542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66286 ms. Remains : 467/467 places, 1324/1324 transitions.
[2024-05-23 07:45:33] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
Found an invariant !
This invariant on transitions {204=1, 340=1, 671=1, 757=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 338=1, 541=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :[3, 1, 1, 1, 1, 3, 2, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:45:33] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:45:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
RANDOM walk for 1000000 steps (2 resets) in 2320 ms. (430 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 14674 ms. (613 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
[2024-05-23 07:45:50] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:45:50] [INFO ] Invariant cache hit.
[2024-05-23 07:45:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:51] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 07:45:51] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:45:51] [INFO ] [Real]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 07:45:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:45:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:45:51] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-23 07:45:51] [INFO ] [Nat]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 07:45:51] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 68 ms.
[2024-05-23 07:45:51] [INFO ] Added : 15 causal constraints over 5 iterations in 288 ms. Result :sat
Minimization took 275 ms.
[2024-05-23 07:45:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:45:52] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 07:45:52] [INFO ] [Real]Added 91 Read/Feed constraints in 45 ms returned sat
[2024-05-23 07:45:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:45:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:45:52] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 07:45:52] [INFO ] [Nat]Added 91 Read/Feed constraints in 32 ms returned sat
[2024-05-23 07:45:52] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:45:52] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 274 ms.
[2024-05-23 07:45:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:53] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 07:45:53] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 07:45:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:45:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:45:53] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 07:45:53] [INFO ] [Nat]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:45:53] [INFO ] Deduced a trap composed of 145 places in 209 ms of which 3 ms to minimize.
[2024-05-23 07:45:54] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 3 ms to minimize.
[2024-05-23 07:45:54] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 3 ms to minimize.
[2024-05-23 07:45:54] [INFO ] Deduced a trap composed of 126 places in 193 ms of which 3 ms to minimize.
[2024-05-23 07:45:54] [INFO ] Deduced a trap composed of 118 places in 189 ms of which 3 ms to minimize.
[2024-05-23 07:45:54] [INFO ] Deduced a trap composed of 146 places in 194 ms of which 3 ms to minimize.
[2024-05-23 07:45:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1347 ms
[2024-05-23 07:45:55] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:45:55] [INFO ] Added : 5 causal constraints over 3 iterations in 219 ms. Result :sat
Minimization took 289 ms.
[2024-05-23 07:45:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:55] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 07:45:55] [INFO ] [Real]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 07:45:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:45:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:45:56] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 07:45:56] [INFO ] [Nat]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-23 07:45:56] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:45:56] [INFO ] Added : 5 causal constraints over 3 iterations in 239 ms. Result :sat
Minimization took 263 ms.
[2024-05-23 07:45:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:56] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 07:45:56] [INFO ] [Real]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-23 07:45:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:45:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:57] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 07:45:57] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 07:45:57] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:45:57] [INFO ] Added : 9 causal constraints over 3 iterations in 219 ms. Result :sat
Minimization took 261 ms.
[2024-05-23 07:45:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:57] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:45:57] [INFO ] [Real]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-23 07:45:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:45:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:58] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:45:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 58 ms returned sat
[2024-05-23 07:45:58] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 68 ms.
[2024-05-23 07:45:58] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 249 ms.
[2024-05-23 07:45:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:58] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:45:58] [INFO ] [Real]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:45:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:45:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:59] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 07:45:59] [INFO ] [Nat]Added 91 Read/Feed constraints in 32 ms returned sat
[2024-05-23 07:45:59] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:45:59] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 254 ms.
[2024-05-23 07:45:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:45:59] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 07:46:00] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-23 07:46:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:46:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:46:00] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 07:46:00] [INFO ] [Nat]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 07:46:00] [INFO ] Deduced a trap composed of 145 places in 198 ms of which 2 ms to minimize.
[2024-05-23 07:46:00] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 3 ms to minimize.
[2024-05-23 07:46:00] [INFO ] Deduced a trap composed of 126 places in 190 ms of which 3 ms to minimize.
[2024-05-23 07:46:01] [INFO ] Deduced a trap composed of 121 places in 190 ms of which 3 ms to minimize.
[2024-05-23 07:46:01] [INFO ] Deduced a trap composed of 119 places in 192 ms of which 2 ms to minimize.
[2024-05-23 07:46:01] [INFO ] Deduced a trap composed of 118 places in 194 ms of which 2 ms to minimize.
[2024-05-23 07:46:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1323 ms
[2024-05-23 07:46:01] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 63 ms.
[2024-05-23 07:46:01] [INFO ] Added : 5 causal constraints over 3 iterations in 226 ms. Result :sat
Minimization took 269 ms.
[2024-05-23 07:46:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:46:02] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 07:46:02] [INFO ] [Real]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 07:46:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:46:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:46:02] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 07:46:02] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 07:46:02] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 72 ms.
[2024-05-23 07:46:02] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Support contains 9 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 49 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 467/467 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 48 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-23 07:46:04] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:46:04] [INFO ] Invariant cache hit.
[2024-05-23 07:46:04] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-23 07:46:04] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:46:04] [INFO ] Invariant cache hit.
[2024-05-23 07:46:04] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:46:06] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
[2024-05-23 07:46:06] [INFO ] Redundant transitions in 20 ms returned []
Running 1322 sub problems to find dead transitions.
[2024-05-23 07:46:06] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:46:06] [INFO ] Invariant cache hit.
[2024-05-23 07:46:06] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1229/1229 variables, and 561 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 1322/1883 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1229/1229 variables, and 1883 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
After SMT, in 64219ms problems are : Problem set: 0 solved, 1322 unsolved
Search for dead transitions found 0 dead transitions in 64230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65971 ms. Remains : 467/467 places, 1324/1324 transitions.
[2024-05-23 07:47:10] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
Found an invariant !
This invariant on transitions {204=1, 340=1, 671=1, 757=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 338=1, 541=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :[1, 1, 1, 2, 2, 4, 3, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
RANDOM walk for 40003 steps (8 resets) in 987 ms. (40 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 190755 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 11
Probabilistic random walk after 190755 steps, saw 116986 distinct states, run finished after 3004 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-23 07:47:14] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:47:14] [INFO ] Invariant cache hit.
[2024-05-23 07:47:14] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 656/1047 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1047 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 85/1132 variables, 19/411 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1132 variables, 84/496 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 13/1145 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1145 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1145 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 65/1210 variables, 43/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1210 variables, 7/548 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1210 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 18/1228 variables, 12/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1228 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1/1229 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1229 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/1229 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1229/1229 variables, and 561 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 656/1047 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1047 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 85/1132 variables, 19/411 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1132 variables, 84/496 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 11/507 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 07:47:17] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1132 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 13/1145 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1145 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1145 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 65/1210 variables, 43/553 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1210 variables, 7/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1210 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 18/1228 variables, 12/572 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1228 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 1/1229 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1229 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 0/1229 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1229/1229 variables, and 573 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2531 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 4585ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 38155 ms.
Support contains 9 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 48 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 467/467 places, 1324/1324 transitions.
RANDOM walk for 40000 steps (8 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 210106 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 11
Probabilistic random walk after 210106 steps, saw 128849 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-23 07:48:00] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:48:00] [INFO ] Invariant cache hit.
[2024-05-23 07:48:00] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 656/1047 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1047 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 85/1132 variables, 19/411 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1132 variables, 84/496 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 13/1145 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1145 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1145 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 65/1210 variables, 43/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1210 variables, 7/548 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1210 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 18/1228 variables, 12/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1228 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1/1229 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1229 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/1229 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1229/1229 variables, and 561 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1894 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 656/1047 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1047 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 85/1132 variables, 19/411 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1132 variables, 84/496 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 11/507 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 07:48:02] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1132 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 13/1145 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1145 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1145 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 65/1210 variables, 43/553 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1210 variables, 7/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1210 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 18/1228 variables, 12/572 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1228 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 1/1229 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1229 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 0/1229 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1229/1229 variables, and 573 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2510 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 4416ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 37391 ms.
Support contains 9 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 52 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 467/467 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Applied a total of 0 rules in 52 ms. Remains 467 /467 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-23 07:48:42] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:48:42] [INFO ] Invariant cache hit.
[2024-05-23 07:48:42] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-23 07:48:42] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:48:42] [INFO ] Invariant cache hit.
[2024-05-23 07:48:42] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:48:43] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
[2024-05-23 07:48:43] [INFO ] Redundant transitions in 22 ms returned []
Running 1322 sub problems to find dead transitions.
[2024-05-23 07:48:43] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:48:43] [INFO ] Invariant cache hit.
[2024-05-23 07:48:43] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1229/1229 variables, and 561 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 2 (OVERLAPS) 762/1229 variables, 467/470 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1229 variables, 91/561 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 1322/1883 constraints. Problems are: Problem set: 0 solved, 1322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1229/1229 variables, and 1883 constraints, problems are : Problem set: 0 solved, 1322 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 467/467 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1322/1322 constraints, Known Traps: 0/0 constraints]
After SMT, in 64824ms problems are : Problem set: 0 solved, 1322 unsolved
Search for dead transitions found 0 dead transitions in 64841ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66622 ms. Remains : 467/467 places, 1324/1324 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[30, 126, 37, 30, 24, 78, 282, 25, 127] Max Struct:[+inf, 128, +inf, +inf, +inf, +inf, +inf, +inf, 128]
Starting property specific reduction for FunctionPointer-PT-c128-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 07:49:48] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:49:48] [INFO ] Invariant cache hit.
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:[4] Max Struct:[+inf]
[2024-05-23 07:49:48] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:49:48] [INFO ] Invariant cache hit.
[2024-05-23 07:49:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:49:49] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 07:49:49] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:49:49] [INFO ] [Real]Added 91 Read/Feed constraints in 30 ms returned sat
[2024-05-23 07:49:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:49:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:49:49] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 07:49:49] [INFO ] [Nat]Added 91 Read/Feed constraints in 30 ms returned sat
[2024-05-23 07:49:49] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:49:49] [INFO ] Added : 15 causal constraints over 5 iterations in 302 ms. Result :sat
Minimization took 288 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 461 transition count 1312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 461 transition count 1312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 461 transition count 1306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 455 transition count 1294
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 455 transition count 1294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 450 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 450 transition count 1280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 446 transition count 1270
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 446 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 442 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 438 transition count 1252
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 438 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 434 transition count 1244
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 434 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 430 transition count 1236
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 430 transition count 1236
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 426 transition count 1228
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 424 transition count 1224
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 422 transition count 1220
Applied a total of 96 rules in 199 ms. Remains 422 /467 variables (removed 45) and now considering 1220/1324 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 422/467 places, 1220/1324 transitions.
[2024-05-23 07:49:50] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 07:49:50] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 07:49:50] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 1998 ms. (500 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1403 ms. (712 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[141] Max Struct:[+inf]
[2024-05-23 07:49:53] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:49:53] [INFO ] Invariant cache hit.
[2024-05-23 07:49:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:49:54] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 07:49:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:49:54] [INFO ] [Real]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 07:49:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:49:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:49:54] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 07:49:54] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 07:49:54] [INFO ] Deduced a trap composed of 113 places in 188 ms of which 2 ms to minimize.
[2024-05-23 07:49:54] [INFO ] Deduced a trap composed of 109 places in 178 ms of which 3 ms to minimize.
[2024-05-23 07:49:55] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 3 ms to minimize.
[2024-05-23 07:49:55] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 3 ms to minimize.
[2024-05-23 07:49:55] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 2 ms to minimize.
[2024-05-23 07:49:55] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 2 ms to minimize.
[2024-05-23 07:49:55] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 4 ms to minimize.
[2024-05-23 07:49:55] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 4 ms to minimize.
[2024-05-23 07:49:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1576 ms
[2024-05-23 07:49:56] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 57 ms.
[2024-05-23 07:49:56] [INFO ] Added : 8 causal constraints over 2 iterations in 211 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[141] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[141] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 07:49:56] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:49:56] [INFO ] Invariant cache hit.
[2024-05-23 07:49:56] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-23 07:49:56] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:49:56] [INFO ] Invariant cache hit.
[2024-05-23 07:49:57] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:49:57] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2024-05-23 07:49:58] [INFO ] Redundant transitions in 17 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 07:49:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:49:58] [INFO ] Invariant cache hit.
[2024-05-23 07:49:58] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 63703ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 63713ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65173 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 07:51:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[141] Max Struct:[+inf]
[2024-05-23 07:51:02] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:51:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[141] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2129 ms. (469 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1566 ms. (638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[157] Max Struct:[+inf]
[2024-05-23 07:51:05] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:51:05] [INFO ] Invariant cache hit.
[2024-05-23 07:51:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:51:05] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 07:51:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:51:05] [INFO ] [Real]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-23 07:51:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:51:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:51:06] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 07:51:06] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-23 07:51:06] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 3 ms to minimize.
[2024-05-23 07:51:06] [INFO ] Deduced a trap composed of 109 places in 179 ms of which 3 ms to minimize.
[2024-05-23 07:51:06] [INFO ] Deduced a trap composed of 87 places in 176 ms of which 3 ms to minimize.
[2024-05-23 07:51:07] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 3 ms to minimize.
[2024-05-23 07:51:07] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 3 ms to minimize.
[2024-05-23 07:51:07] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 3 ms to minimize.
[2024-05-23 07:51:07] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 3 ms to minimize.
[2024-05-23 07:51:07] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 3 ms to minimize.
[2024-05-23 07:51:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1639 ms
[2024-05-23 07:51:07] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 73 ms.
[2024-05-23 07:51:08] [INFO ] Added : 8 causal constraints over 2 iterations in 237 ms. Result :sat
Minimization took 299 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[157] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[157] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 07:51:08] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:51:08] [INFO ] Invariant cache hit.
[2024-05-23 07:51:08] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-23 07:51:08] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:51:08] [INFO ] Invariant cache hit.
[2024-05-23 07:51:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:51:10] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
[2024-05-23 07:51:10] [INFO ] Redundant transitions in 17 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 07:51:10] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:51:10] [INFO ] Invariant cache hit.
[2024-05-23 07:51:10] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64277ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65856 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 07:52:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[157] Max Struct:[+inf]
[2024-05-23 07:52:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:52:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[157] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2094 ms. (477 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1477 ms. (676 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[165] Max Struct:[+inf]
[2024-05-23 07:52:18] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:52:18] [INFO ] Invariant cache hit.
[2024-05-23 07:52:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:52:18] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 07:52:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:52:18] [INFO ] [Real]Added 75 Read/Feed constraints in 37 ms returned sat
[2024-05-23 07:52:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:52:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:52:18] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 07:52:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 07:52:19] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 3 ms to minimize.
[2024-05-23 07:52:19] [INFO ] Deduced a trap composed of 109 places in 183 ms of which 3 ms to minimize.
[2024-05-23 07:52:19] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 3 ms to minimize.
[2024-05-23 07:52:19] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 3 ms to minimize.
[2024-05-23 07:52:19] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 3 ms to minimize.
[2024-05-23 07:52:20] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 3 ms to minimize.
[2024-05-23 07:52:20] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 3 ms to minimize.
[2024-05-23 07:52:20] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 2 ms to minimize.
[2024-05-23 07:52:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1648 ms
[2024-05-23 07:52:20] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 64 ms.
[2024-05-23 07:52:20] [INFO ] Added : 8 causal constraints over 2 iterations in 218 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[165] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[165] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 47 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 07:52:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:52:21] [INFO ] Invariant cache hit.
[2024-05-23 07:52:21] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-23 07:52:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:52:21] [INFO ] Invariant cache hit.
[2024-05-23 07:52:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:52:22] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
[2024-05-23 07:52:22] [INFO ] Redundant transitions in 17 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 07:52:22] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:52:22] [INFO ] Invariant cache hit.
[2024-05-23 07:52:22] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64201ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65786 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 07:53:26] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[165] Max Struct:[+inf]
[2024-05-23 07:53:27] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:53:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[165] 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 1452 ms. (688 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[165] Max Struct:[+inf]
[2024-05-23 07:53:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:53:30] [INFO ] Invariant cache hit.
[2024-05-23 07:53:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:53:30] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 07:53:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:53:30] [INFO ] [Real]Added 75 Read/Feed constraints in 35 ms returned sat
[2024-05-23 07:53:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:53:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:53:31] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 07:53:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 22 ms returned sat
[2024-05-23 07:53:31] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 3 ms to minimize.
[2024-05-23 07:53:31] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 3 ms to minimize.
[2024-05-23 07:53:31] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 3 ms to minimize.
[2024-05-23 07:53:32] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 2 ms to minimize.
[2024-05-23 07:53:32] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 3 ms to minimize.
[2024-05-23 07:53:32] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 3 ms to minimize.
[2024-05-23 07:53:32] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 3 ms to minimize.
[2024-05-23 07:53:32] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 3 ms to minimize.
[2024-05-23 07:53:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1645 ms
[2024-05-23 07:53:32] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 68 ms.
[2024-05-23 07:53:33] [INFO ] Added : 8 causal constraints over 2 iterations in 211 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[165] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[165] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 07:53:33] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:53:33] [INFO ] Invariant cache hit.
[2024-05-23 07:53:33] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-23 07:53:33] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:53:33] [INFO ] Invariant cache hit.
[2024-05-23 07:53:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:53:34] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
[2024-05-23 07:53:34] [INFO ] Redundant transitions in 19 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 07:53:34] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:53:34] [INFO ] Invariant cache hit.
[2024-05-23 07:53:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64248ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64264ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65759 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 07:54:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[165] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 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 569052 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569052 steps, saw 348934 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-23 07:54:42] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:54:42] [INFO ] Invariant cache hit.
[2024-05-23 07:54:42] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 610ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 332 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40005 steps (8 resets) in 114 ms. (347 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 538418 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 538418 steps, saw 330152 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2024-05-23 07:54:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:54:46] [INFO ] Invariant cache hit.
[2024-05-23 07:54:46] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 617ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 370 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 51 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 07:54:47] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:54:47] [INFO ] Invariant cache hit.
[2024-05-23 07:54:47] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-23 07:54:47] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:54:47] [INFO ] Invariant cache hit.
[2024-05-23 07:54:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:54:49] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2024-05-23 07:54:49] [INFO ] Redundant transitions in 18 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 07:54:49] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 07:54:49] [INFO ] Invariant cache hit.
[2024-05-23 07:54:49] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64027ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64038ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65513 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
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 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
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 1397 place count 21 transition count 34
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 1399 place count 20 transition count 33
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 1401 place count 19 transition count 33
Applied a total of 1401 rules in 81 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 07:55:53] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 07:55:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:55:53] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 07:55:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 07:55:53] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:55:53] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:55:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 07:55:53] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:55:53] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 07:55:53] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 07:55:53] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 160 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[165] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-01 in 364453 ms.
Starting property specific reduction for FunctionPointer-PT-c128-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:[128]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[128]
[2024-05-23 07:55:53] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
// Phase 1: matrix 762 rows 467 cols
[2024-05-23 07:55:53] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[128]
RANDOM walk for 10000 steps (2 resets) in 22 ms. (434 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:[128]
[2024-05-23 07:55:53] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:55:53] [INFO ] Invariant cache hit.
[2024-05-23 07:55:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:55:53] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 07:55:53] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:55:53] [INFO ] [Real]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:55:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:55:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:55:53] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 07:55:53] [INFO ] [Nat]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 07:55:53] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 07:55:54] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[124] Max Struct:[128]
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 460 transition count 1310
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 460 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 460 transition count 1304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 453 transition count 1290
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 453 transition count 1290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 447 transition count 1272
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 447 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 442 transition count 1260
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 442 transition count 1260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 437 transition count 1250
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 432 transition count 1238
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 432 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 427 transition count 1228
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 427 transition count 1228
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 422 transition count 1218
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 422 transition count 1218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 417 transition count 1208
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 417 transition count 1208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 415 transition count 1204
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 414 transition count 1202
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 413 transition count 1200
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 413 transition count 1200
Applied a total of 114 rules in 165 ms. Remains 413 /467 variables (removed 54) and now considering 1200/1324 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 413/467 places, 1200/1324 transitions.
[2024-05-23 07:55:55] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-23 07:55:55] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[124] Max Struct:[128]
RANDOM walk for 1000001 steps (2 resets) in 1964 ms. (508 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1357 ms. (736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[124] Max Struct:[128]
[2024-05-23 07:55:58] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:55:58] [INFO ] Invariant cache hit.
[2024-05-23 07:55:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:55:58] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-23 07:55:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 07:55:58] [INFO ] [Real]Added 72 Read/Feed constraints in 41 ms returned sat
[2024-05-23 07:55:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:55:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:55:58] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-23 07:55:58] [INFO ] [Nat]Added 72 Read/Feed constraints in 34 ms returned sat
[2024-05-23 07:55:58] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 59 ms.
[2024-05-23 07:55:59] [INFO ] Added : 3 causal constraints over 1 iterations in 142 ms. Result :sat
Minimization took 238 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[124] Max Struct:[128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[125] Max Struct:[128]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 41 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 07:55:59] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:55:59] [INFO ] Invariant cache hit.
[2024-05-23 07:56:00] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 07:56:00] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:56:00] [INFO ] Invariant cache hit.
[2024-05-23 07:56:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 07:56:01] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
[2024-05-23 07:56:01] [INFO ] Redundant transitions in 20 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 07:56:01] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:56:01] [INFO ] Invariant cache hit.
[2024-05-23 07:56:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 1198/1686 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1686 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
After SMT, in 63816ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 63825ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65232 ms. Remains : 413/413 places, 1200/1200 transitions.
[2024-05-23 07:57:05] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:57:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[125] Max Struct:[128]
RANDOM walk for 1000000 steps (2 resets) in 1941 ms. (514 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1328 ms. (752 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[125] Max Struct:[128]
[2024-05-23 07:57:08] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:57:08] [INFO ] Invariant cache hit.
[2024-05-23 07:57:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:57:08] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-23 07:57:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 07:57:08] [INFO ] [Real]Added 72 Read/Feed constraints in 46 ms returned sat
[2024-05-23 07:57:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:57:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:57:08] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-23 07:57:08] [INFO ] [Nat]Added 72 Read/Feed constraints in 33 ms returned sat
[2024-05-23 07:57:08] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 58 ms.
[2024-05-23 07:57:08] [INFO ] Added : 3 causal constraints over 1 iterations in 150 ms. Result :sat
Minimization took 235 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[125] Max Struct:[128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[125] Max Struct:[128]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 07:57:09] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:57:09] [INFO ] Invariant cache hit.
[2024-05-23 07:57:10] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-23 07:57:10] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:57:10] [INFO ] Invariant cache hit.
[2024-05-23 07:57:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 07:57:11] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2024-05-23 07:57:11] [INFO ] Redundant transitions in 16 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 07:57:11] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:57:11] [INFO ] Invariant cache hit.
[2024-05-23 07:57:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 1198/1686 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1686 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
After SMT, in 64178ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 64188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65560 ms. Remains : 413/413 places, 1200/1200 transitions.
RANDOM walk for 40005 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 343288 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 2
Probabilistic random walk after 343288 steps, saw 210509 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-23 07:58:18] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:58:18] [INFO ] Invariant cache hit.
[2024-05-23 07:58:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/1049 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1066 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1074 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/1082 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/1088 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1049 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/1066 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1074 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1082 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/1088 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1057ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2670 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 413/413 places, 1200/1200 transitions.
RANDOM walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 375944 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 2
Probabilistic random walk after 375944 steps, saw 230533 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2024-05-23 07:58:25] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:58:25] [INFO ] Invariant cache hit.
[2024-05-23 07:58:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/1049 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1066 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1074 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/1082 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/1088 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1049 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/1066 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1074 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1082 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/1088 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 993ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2592 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 07:58:28] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:58:28] [INFO ] Invariant cache hit.
[2024-05-23 07:58:29] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-23 07:58:29] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:58:29] [INFO ] Invariant cache hit.
[2024-05-23 07:58:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 07:58:30] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-23 07:58:30] [INFO ] Redundant transitions in 18 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 07:58:30] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 07:58:30] [INFO ] Invariant cache hit.
[2024-05-23 07:58:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 1198/1686 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1686 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
After SMT, in 63760ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 63770ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65163 ms. Remains : 413/413 places, 1200/1200 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 413 transition count 664
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 402 transition count 664
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 547 place count 402 transition count 596
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 683 place count 334 transition count 596
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 935 place count 208 transition count 470
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 998 place count 145 transition count 344
Iterating global reduction 2 with 63 rules applied. Total rules applied 1061 place count 145 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 1062 place count 145 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 1062 place count 145 transition count 342
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 1064 place count 144 transition count 342
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1126 place count 82 transition count 218
Iterating global reduction 3 with 62 rules applied. Total rules applied 1188 place count 82 transition count 218
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1250 place count 20 transition count 94
Iterating global reduction 3 with 62 rules applied. Total rules applied 1312 place count 20 transition count 94
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1374 place count 20 transition count 32
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 1376 place count 19 transition count 33
Applied a total of 1376 rules in 34 ms. Remains 19 /413 variables (removed 394) and now considering 33/1200 (removed 1167) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 07:59:34] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 07:59:34] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 07:59:34] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 07:59:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 07:59:34] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 07:59:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 07:59:34] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 07:59:34] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 07:59:34] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 121 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[125] Max Struct:[128]
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-02 in 220820 ms.
Starting property specific reduction for FunctionPointer-PT-c128-UpperBounds-04
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-23 07:59:34] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
// Phase 1: matrix 762 rows 467 cols
[2024-05-23 07:59:34] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 21 ms. (454 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-23 07:59:34] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 07:59:34] [INFO ] Invariant cache hit.
[2024-05-23 07:59:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:59:34] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 07:59:34] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 07:59:34] [INFO ] [Real]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 07:59:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:59:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:59:34] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 07:59:34] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-23 07:59:34] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 67 ms.
[2024-05-23 07:59:34] [INFO ] Added : 18 causal constraints over 4 iterations in 259 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:[2] Max Struct:[+inf]
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 461 transition count 1312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 461 transition count 1312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 461 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 455 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 455 transition count 1296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 450 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 450 transition count 1280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 446 transition count 1270
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 446 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 442 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 438 transition count 1254
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 438 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 434 transition count 1246
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 434 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 430 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 430 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 426 transition count 1230
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 426 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 425 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 425 transition count 1228
Applied a total of 88 rules in 130 ms. Remains 425 /467 variables (removed 42) and now considering 1228/1324 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 425/467 places, 1228/1324 transitions.
[2024-05-23 07:59:35] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
Found an invariant !
This invariant on transitions {196=1, 292=1, 618=1, 691=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 348=1, 674=1, 692=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 07:59:35] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
// Phase 1: matrix 693 rows 425 cols
[2024-05-23 07:59:35] [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 2070 ms. (482 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1421 ms. (703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[142] Max Struct:[+inf]
[2024-05-23 07:59:39] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 07:59:39] [INFO ] Invariant cache hit.
[2024-05-23 07:59:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:59:39] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-23 07:59:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:59:39] [INFO ] [Real]Added 75 Read/Feed constraints in 21 ms returned sat
[2024-05-23 07:59:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:59:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 07:59:39] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 07:59:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 20 ms returned sat
[2024-05-23 07:59:39] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 3 ms to minimize.
[2024-05-23 07:59:40] [INFO ] Deduced a trap composed of 105 places in 175 ms of which 2 ms to minimize.
[2024-05-23 07:59:40] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 3 ms to minimize.
[2024-05-23 07:59:40] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 3 ms to minimize.
[2024-05-23 07:59:40] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 2 ms to minimize.
[2024-05-23 07:59:40] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 3 ms to minimize.
[2024-05-23 07:59:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1254 ms
[2024-05-23 07:59:40] [INFO ] Computed and/alt/rep : 339/1256/332 causal constraints (skipped 359 transitions) in 59 ms.
[2024-05-23 07:59:41] [INFO ] Added : 19 causal constraints over 4 iterations in 250 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[142] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[142] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1228/1228 transitions.
Applied a total of 0 rules in 42 ms. Remains 425 /425 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 425/425 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1228/1228 transitions.
Applied a total of 0 rules in 41 ms. Remains 425 /425 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-05-23 07:59:42] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 07:59:42] [INFO ] Invariant cache hit.
[2024-05-23 07:59:42] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-23 07:59:42] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 07:59:42] [INFO ] Invariant cache hit.
[2024-05-23 07:59:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 07:59:44] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
[2024-05-23 07:59:44] [INFO ] Redundant transitions in 21 ms returned []
Running 1226 sub problems to find dead transitions.
[2024-05-23 07:59:44] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 07:59:44] [INFO ] Invariant cache hit.
[2024-05-23 07:59:44] [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, 1226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 2 (OVERLAPS) 693/1118 variables, 425/428 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1118 variables, 75/503 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 503 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1226/1226 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 2 (OVERLAPS) 693/1118 variables, 425/428 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1118 variables, 75/503 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1118 variables, 1226/1729 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 1729 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1226/1226 constraints, Known Traps: 0/0 constraints]
After SMT, in 63820ms problems are : Problem set: 0 solved, 1226 unsolved
Search for dead transitions found 0 dead transitions in 63830ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65407 ms. Remains : 425/425 places, 1228/1228 transitions.
[2024-05-23 08:00:47] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
Found an invariant !
This invariant on transitions {196=1, 292=1, 618=1, 691=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 348=1, 674=1, 692=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[142] Max Struct:[+inf]
[2024-05-23 08:00:48] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:00:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[142] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2063 ms. (484 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1527 ms. (654 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[142] Max Struct:[+inf]
[2024-05-23 08:00:51] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:00:51] [INFO ] Invariant cache hit.
[2024-05-23 08:00:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:00:51] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-23 08:00:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:00:52] [INFO ] [Real]Added 75 Read/Feed constraints in 20 ms returned sat
[2024-05-23 08:00:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:00:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:00:52] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 08:00:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2024-05-23 08:00:52] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 3 ms to minimize.
[2024-05-23 08:00:52] [INFO ] Deduced a trap composed of 105 places in 183 ms of which 3 ms to minimize.
[2024-05-23 08:00:52] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 3 ms to minimize.
[2024-05-23 08:00:53] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 3 ms to minimize.
[2024-05-23 08:00:53] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 3 ms to minimize.
[2024-05-23 08:00:53] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 3 ms to minimize.
[2024-05-23 08:00:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1287 ms
[2024-05-23 08:00:53] [INFO ] Computed and/alt/rep : 339/1256/332 causal constraints (skipped 359 transitions) in 87 ms.
[2024-05-23 08:00:53] [INFO ] Added : 19 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 283 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[142] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[142] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1228/1228 transitions.
Applied a total of 0 rules in 44 ms. Remains 425 /425 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 425/425 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1228/1228 transitions.
Applied a total of 0 rules in 62 ms. Remains 425 /425 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-05-23 08:00:55] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:00:55] [INFO ] Invariant cache hit.
[2024-05-23 08:00:55] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-23 08:00:55] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:00:55] [INFO ] Invariant cache hit.
[2024-05-23 08:00:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:00:56] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1488 ms to find 0 implicit places.
[2024-05-23 08:00:56] [INFO ] Redundant transitions in 19 ms returned []
Running 1226 sub problems to find dead transitions.
[2024-05-23 08:00:56] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:00:56] [INFO ] Invariant cache hit.
[2024-05-23 08:00:56] [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, 1226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 2 (OVERLAPS) 693/1118 variables, 425/428 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1118 variables, 75/503 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 503 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1226/1226 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 2 (OVERLAPS) 693/1118 variables, 425/428 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1118 variables, 75/503 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1118 variables, 1226/1729 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 1729 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1226/1226 constraints, Known Traps: 0/0 constraints]
After SMT, in 64255ms problems are : Problem set: 0 solved, 1226 unsolved
Search for dead transitions found 0 dead transitions in 64266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65848 ms. Remains : 425/425 places, 1228/1228 transitions.
[2024-05-23 08:02:01] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
Found an invariant !
This invariant on transitions {196=1, 292=1, 618=1, 691=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 348=1, 674=1, 692=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[142] Max Struct:[+inf]
RANDOM walk for 40005 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567809 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 567809 steps, saw 348172 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-23 08:02:04] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:02:04] [INFO ] Invariant cache hit.
[2024-05-23 08:02:04] [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) 7/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 349/359 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/369 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 604/973 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/973 variables, 74/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/973 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1035 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1035 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 73/1108 variables, 69/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1108 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 7/1115 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/1118 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1118 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1118 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 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) 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) 7/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 349/359 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/369 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 604/973 variables, 338/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/973 variables, 74/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/973 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1035 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1035 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 73/1108 variables, 69/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1108 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1115 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/1118 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1118 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1118 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 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 652ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 946 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1228/1228 transitions.
Applied a total of 0 rules in 42 ms. Remains 425 /425 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 425/425 places, 1228/1228 transitions.
RANDOM walk for 40008 steps (8 resets) in 114 ms. (347 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 562655 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 562655 steps, saw 345013 distinct states, run finished after 3002 ms. (steps per millisecond=187 ) properties seen :0
[2024-05-23 08:02:09] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:02:09] [INFO ] Invariant cache hit.
[2024-05-23 08:02: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) 7/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 349/359 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/369 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 604/973 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/973 variables, 74/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/973 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1035 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1035 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 73/1108 variables, 69/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1108 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 7/1115 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/1118 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1118 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1118 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 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) 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) 7/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 349/359 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/369 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 604/973 variables, 338/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/973 variables, 74/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/973 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1035 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1035 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 73/1108 variables, 69/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1108 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1115 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/1118 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1118 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1118 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 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 698ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 946 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1228/1228 transitions.
Applied a total of 0 rules in 41 ms. Remains 425 /425 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 425/425 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1228/1228 transitions.
Applied a total of 0 rules in 41 ms. Remains 425 /425 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-05-23 08:02:10] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:02:10] [INFO ] Invariant cache hit.
[2024-05-23 08:02:11] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-23 08:02:11] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:02:11] [INFO ] Invariant cache hit.
[2024-05-23 08:02:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:02:12] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
[2024-05-23 08:02:12] [INFO ] Redundant transitions in 19 ms returned []
Running 1226 sub problems to find dead transitions.
[2024-05-23 08:02:12] [INFO ] Flow matrix only has 693 transitions (discarded 535 similar events)
[2024-05-23 08:02:12] [INFO ] Invariant cache hit.
[2024-05-23 08:02: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, 1226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 2 (OVERLAPS) 693/1118 variables, 425/428 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1118 variables, 75/503 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 503 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1226/1226 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 2 (OVERLAPS) 693/1118 variables, 425/428 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1118 variables, 75/503 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1118 variables, 1226/1729 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 1729 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1226/1226 constraints, Known Traps: 0/0 constraints]
After SMT, in 64170ms problems are : Problem set: 0 solved, 1226 unsolved
Search for dead transitions found 0 dead transitions in 64180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65731 ms. Remains : 425/425 places, 1228/1228 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 425 transition count 680
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 561 place count 412 transition count 680
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 561 place count 412 transition count 608
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 705 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 961 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 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 1090 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1153 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1216 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1279 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1342 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 1405 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 1405 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 1407 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 1409 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 1411 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 1414 place count 19 transition count 31
Applied a total of 1414 rules in 27 ms. Remains 19 /425 variables (removed 406) and now considering 31/1228 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 08:03:16] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 08:03:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 08:03:16] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 08:03:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 08:03:16] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:03:16] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:03:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 08:03:16] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 08:03:16] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 08:03:16] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 08:03:16] [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:[142] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-04 in 222639 ms.
Starting property specific reduction for FunctionPointer-PT-c128-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-23 08:03:16] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
// Phase 1: matrix 762 rows 467 cols
[2024-05-23 08:03:16] [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 21 ms. (454 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:[8] Max Struct:[+inf]
[2024-05-23 08:03:16] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 08:03:16] [INFO ] Invariant cache hit.
[2024-05-23 08:03:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:03:16] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 08:03:16] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 08:03:17] [INFO ] [Real]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 08:03:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:03:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:03:17] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 08:03:17] [INFO ] [Nat]Added 91 Read/Feed constraints in 56 ms returned sat
[2024-05-23 08:03:17] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 08:03:17] [INFO ] Added : 5 causal constraints over 3 iterations in 225 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[+inf]
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 461 transition count 1312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 461 transition count 1312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 461 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 455 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 455 transition count 1296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 450 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 450 transition count 1280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 446 transition count 1272
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 446 transition count 1272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 442 transition count 1264
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 442 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 438 transition count 1254
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 438 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 434 transition count 1246
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 434 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 430 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 430 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 426 transition count 1230
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 426 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 425 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 425 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 424 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 423 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 423 transition count 1224
Applied a total of 92 rules in 160 ms. Remains 423 /467 variables (removed 44) and now considering 1224/1324 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 423/467 places, 1224/1324 transitions.
[2024-05-23 08:03:18] [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 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
[2024-05-23 08:03:18] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2024-05-23 08:03:18] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2070 ms. (482 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1397 ms. (715 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[142] Max Struct:[+inf]
[2024-05-23 08:03:21] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:03:21] [INFO ] Invariant cache hit.
[2024-05-23 08:03:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:03:22] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-23 08:03:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:03:22] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-23 08:03:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:03:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:03:22] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-23 08:03:22] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 08:03:22] [INFO ] Deduced a trap composed of 113 places in 182 ms of which 3 ms to minimize.
[2024-05-23 08:03:22] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 3 ms to minimize.
[2024-05-23 08:03:22] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 3 ms to minimize.
[2024-05-23 08:03:23] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 3 ms to minimize.
[2024-05-23 08:03:23] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 3 ms to minimize.
[2024-05-23 08:03:23] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 3 ms to minimize.
[2024-05-23 08:03:23] [INFO ] Deduced a trap composed of 77 places in 196 ms of which 2 ms to minimize.
[2024-05-23 08:03:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1484 ms
[2024-05-23 08:03:23] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 59 ms.
[2024-05-23 08:03:24] [INFO ] Added : 22 causal constraints over 5 iterations in 285 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[142] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[142] 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 41 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 41 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-23 08:03:25] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:03:25] [INFO ] Invariant cache hit.
[2024-05-23 08:03:25] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-23 08:03:25] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:03:25] [INFO ] Invariant cache hit.
[2024-05-23 08:03:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:03:26] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2024-05-23 08:03:26] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 08:03:26] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:03:26] [INFO ] Invariant cache hit.
[2024-05-23 08:03:26] [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
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (OVERLAPS) 691/1114 variables, 423/426 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1114 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (OVERLAPS) 691/1114 variables, 423/426 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1114 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1114 variables, 1222/1723 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 1723 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 0/0 constraints]
After SMT, in 63892ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 63902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65356 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 08:04:30] [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 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[142] Max Struct:[+inf]
[2024-05-23 08:04:30] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:04:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[142] Max Struct:[+inf]
RANDOM walk for 1000005 steps (2 resets) in 2207 ms. (452 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1604 ms. (623 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[142] Max Struct:[+inf]
[2024-05-23 08:04:34] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:04:34] [INFO ] Invariant cache hit.
[2024-05-23 08:04:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 08:04:35] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 08:04:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:04:35] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-23 08:04:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:04:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 08:04:35] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 08:04:35] [INFO ] [Nat]Added 75 Read/Feed constraints in 30 ms returned sat
[2024-05-23 08:04:35] [INFO ] Deduced a trap composed of 113 places in 200 ms of which 3 ms to minimize.
[2024-05-23 08:04:35] [INFO ] Deduced a trap composed of 90 places in 185 ms of which 3 ms to minimize.
[2024-05-23 08:04:36] [INFO ] Deduced a trap composed of 78 places in 183 ms of which 2 ms to minimize.
[2024-05-23 08:04:36] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 2 ms to minimize.
[2024-05-23 08:04:36] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 2 ms to minimize.
[2024-05-23 08:04:36] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 2 ms to minimize.
[2024-05-23 08:04:36] [INFO ] Deduced a trap composed of 77 places in 195 ms of which 2 ms to minimize.
[2024-05-23 08:04:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1488 ms
[2024-05-23 08:04:36] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 65 ms.
[2024-05-23 08:04:37] [INFO ] Added : 22 causal constraints over 5 iterations in 289 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[142] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[142] 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 58 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 58 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 48 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 08:04:38] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:04:38] [INFO ] Invariant cache hit.
[2024-05-23 08:04:38] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-23 08:04:38] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:04:38] [INFO ] Invariant cache hit.
[2024-05-23 08:04:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:04:39] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2024-05-23 08:04:39] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 08:04:39] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:04:39] [INFO ] Invariant cache hit.
[2024-05-23 08:04:39] [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
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (OVERLAPS) 691/1114 variables, 423/426 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1114 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (OVERLAPS) 691/1114 variables, 423/426 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1114 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1114 variables, 1222/1723 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 1723 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 0/0 constraints]
After SMT, in 64604ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64616ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66136 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 08:05:44] [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 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[142] Max Struct:[+inf]
RANDOM walk for 40008 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 568454 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 568454 steps, saw 348568 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-23 08:05:47] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:05:47] [INFO ] Invariant cache hit.
[2024-05-23 08:05:47] [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 292 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 340 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 641ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 833 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 46 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 46 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40003 steps (8 resets) in 98 ms. (404 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 523959 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 523959 steps, saw 321286 distinct states, run finished after 3002 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 08:05:52] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:05:52] [INFO ] Invariant cache hit.
[2024-05-23 08:05:52] [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 310 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 333 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 654ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 864 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 47 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 47 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 47 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 08:05:54] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:05:54] [INFO ] Invariant cache hit.
[2024-05-23 08:05:54] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-23 08:05:54] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:05:54] [INFO ] Invariant cache hit.
[2024-05-23 08:05:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:05:55] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2024-05-23 08:05:55] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 08:05:55] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 08:05:55] [INFO ] Invariant cache hit.
[2024-05-23 08:05:55] [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
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (OVERLAPS) 691/1114 variables, 423/426 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1114 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (OVERLAPS) 691/1114 variables, 423/426 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1114 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1114 variables, 1222/1723 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 1723 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 0/0 constraints]
After SMT, in 64184ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64196ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65676 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 1 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 32 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-23 08:06:59] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 08:06:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 08:06:59] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 08:06:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 08:06:59] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:06:59] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:06:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 08:06:59] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 08:06:59] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 08:06:59] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 08:06:59] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 101 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[142] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-05 in 223168 ms.
Starting property specific reduction for FunctionPointer-PT-c128-UpperBounds-07
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-23 08:06:59] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
// Phase 1: matrix 762 rows 467 cols
[2024-05-23 08:06:59] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 21 ms. (454 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-23 08:06:59] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 08:06:59] [INFO ] Invariant cache hit.
[2024-05-23 08:06:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 08:07:00] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-23 08:07:00] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 08:07:00] [INFO ] [Real]Added 91 Read/Feed constraints in 30 ms returned sat
[2024-05-23 08:07:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:07:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:07:00] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 08:07:00] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 08:07:00] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 65 ms.
[2024-05-23 08:07:00] [INFO ] Added : 9 causal constraints over 3 iterations in 223 ms. Result :sat
Minimization took 270 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 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 461 transition count 1312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 461 transition count 1312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 461 transition count 1306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 455 transition count 1294
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 455 transition count 1294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 450 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 450 transition count 1280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 446 transition count 1270
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 446 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 442 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 438 transition count 1252
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 438 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 434 transition count 1244
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 434 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 430 transition count 1236
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 430 transition count 1236
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 426 transition count 1228
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 424 transition count 1224
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 422 transition count 1220
Applied a total of 96 rules in 152 ms. Remains 422 /467 variables (removed 45) and now considering 1220/1324 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 422/467 places, 1220/1324 transitions.
[2024-05-23 08:07:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 08:07:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 08:07:01] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1995 ms. (501 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1430 ms. (698 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[138] Max Struct:[+inf]
[2024-05-23 08:07:04] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:07:04] [INFO ] Invariant cache hit.
[2024-05-23 08:07:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 08:07:05] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 08:07:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:07:05] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-23 08:07:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:07:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:07:05] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 08:07:05] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2024-05-23 08:07:05] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 3 ms to minimize.
[2024-05-23 08:07:05] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 3 ms to minimize.
[2024-05-23 08:07:05] [INFO ] Deduced a trap composed of 87 places in 170 ms of which 3 ms to minimize.
[2024-05-23 08:07:06] [INFO ] Deduced a trap composed of 85 places in 169 ms of which 2 ms to minimize.
[2024-05-23 08:07:06] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 2 ms to minimize.
[2024-05-23 08:07:06] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 2 ms to minimize.
[2024-05-23 08:07:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1170 ms
[2024-05-23 08:07:06] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 61 ms.
[2024-05-23 08:07:06] [INFO ] Added : 12 causal constraints over 4 iterations in 292 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[138] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[138] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 08:07:07] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:07:07] [INFO ] Invariant cache hit.
[2024-05-23 08:07:07] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-23 08:07:07] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:07:07] [INFO ] Invariant cache hit.
[2024-05-23 08:07:07] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:07:08] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
[2024-05-23 08:07:08] [INFO ] Redundant transitions in 20 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 08:07:08] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:07:08] [INFO ] Invariant cache hit.
[2024-05-23 08:07:08] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64042ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64052ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65509 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 08:08:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[138] Max Struct:[+inf]
[2024-05-23 08:08:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:08:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[138] Max Struct:[+inf]
RANDOM walk for 1000004 steps (2 resets) in 2038 ms. (490 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1521 ms. (657 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[144] Max Struct:[+inf]
[2024-05-23 08:08:16] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:08:16] [INFO ] Invariant cache hit.
[2024-05-23 08:08:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:08:17] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 08:08:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:08:17] [INFO ] [Real]Added 75 Read/Feed constraints in 30 ms returned sat
[2024-05-23 08:08:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:08:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:08:17] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 08:08:17] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2024-05-23 08:08:17] [INFO ] Deduced a trap composed of 113 places in 181 ms of which 3 ms to minimize.
[2024-05-23 08:08:17] [INFO ] Deduced a trap composed of 109 places in 176 ms of which 3 ms to minimize.
[2024-05-23 08:08:17] [INFO ] Deduced a trap composed of 87 places in 176 ms of which 3 ms to minimize.
[2024-05-23 08:08:18] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 2 ms to minimize.
[2024-05-23 08:08:18] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 3 ms to minimize.
[2024-05-23 08:08:18] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 2 ms to minimize.
[2024-05-23 08:08:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1198 ms
[2024-05-23 08:08:18] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 70 ms.
[2024-05-23 08:08:18] [INFO ] Added : 12 causal constraints over 4 iterations in 307 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[144] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[144] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 08:08:19] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:08:19] [INFO ] Invariant cache hit.
[2024-05-23 08:08:19] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-23 08:08:19] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:08:19] [INFO ] Invariant cache hit.
[2024-05-23 08:08:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:08:21] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
[2024-05-23 08:08:21] [INFO ] Redundant transitions in 18 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 08:08:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:08:21] [INFO ] Invariant cache hit.
[2024-05-23 08:08:21] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64034ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64045ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65547 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 08:09:25] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[144] Max Struct:[+inf]
[2024-05-23 08:09:25] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:09:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[144] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2062 ms. (484 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1441 ms. (693 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[153] Max Struct:[+inf]
[2024-05-23 08:09:28] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:09:28] [INFO ] Invariant cache hit.
[2024-05-23 08:09:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:09:29] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 08:09:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:09:29] [INFO ] [Real]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-23 08:09:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:09:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:09:29] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 08:09:29] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-23 08:09:29] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 3 ms to minimize.
[2024-05-23 08:09:29] [INFO ] Deduced a trap composed of 109 places in 189 ms of which 3 ms to minimize.
[2024-05-23 08:09:30] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 3 ms to minimize.
[2024-05-23 08:09:30] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 3 ms to minimize.
[2024-05-23 08:09:30] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 2 ms to minimize.
[2024-05-23 08:09:30] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 6 ms to minimize.
[2024-05-23 08:09:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1267 ms
[2024-05-23 08:09:30] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 68 ms.
[2024-05-23 08:09:31] [INFO ] Added : 12 causal constraints over 4 iterations in 304 ms. Result :sat
Minimization took 252 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[153] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[153] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 47 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 08:09:31] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:09:31] [INFO ] Invariant cache hit.
[2024-05-23 08:09:32] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-23 08:09:32] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:09:32] [INFO ] Invariant cache hit.
[2024-05-23 08:09:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:09:33] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
[2024-05-23 08:09:33] [INFO ] Redundant transitions in 21 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 08:09:33] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:09:33] [INFO ] Invariant cache hit.
[2024-05-23 08:09:33] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64697ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64709ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66268 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 08:10:37] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[153] Max Struct:[+inf]
[2024-05-23 08:10:38] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:10:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[153] Max Struct:[+inf]
RANDOM walk for 1000004 steps (2 resets) in 2042 ms. (489 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1388 ms. (719 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[153] Max Struct:[+inf]
[2024-05-23 08:10:41] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:10:41] [INFO ] Invariant cache hit.
[2024-05-23 08:10:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:10:41] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 08:10:41] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:10:41] [INFO ] [Real]Added 75 Read/Feed constraints in 30 ms returned sat
[2024-05-23 08:10:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:10:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:10:42] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 08:10:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2024-05-23 08:10:42] [INFO ] Deduced a trap composed of 113 places in 201 ms of which 3 ms to minimize.
[2024-05-23 08:10:42] [INFO ] Deduced a trap composed of 109 places in 199 ms of which 3 ms to minimize.
[2024-05-23 08:10:42] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 3 ms to minimize.
[2024-05-23 08:10:43] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 2 ms to minimize.
[2024-05-23 08:10:43] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 3 ms to minimize.
[2024-05-23 08:10:43] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 2 ms to minimize.
[2024-05-23 08:10:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1307 ms
[2024-05-23 08:10:43] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 69 ms.
[2024-05-23 08:10:43] [INFO ] Added : 12 causal constraints over 4 iterations in 318 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[153] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[153] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 46 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 08:10:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:10:44] [INFO ] Invariant cache hit.
[2024-05-23 08:10:44] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-23 08:10:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:10:44] [INFO ] Invariant cache hit.
[2024-05-23 08:10:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:10:45] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
[2024-05-23 08:10:46] [INFO ] Redundant transitions in 20 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 08:10:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:10:46] [INFO ] Invariant cache hit.
[2024-05-23 08:10:46] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 63810ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 63819ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65302 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 08:11:49] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[153] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 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 580229 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 1
Probabilistic random walk after 580229 steps, saw 355786 distinct states, run finished after 3002 ms. (steps per millisecond=193 ) properties seen :0
[2024-05-23 08:11:53] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:11:53] [INFO ] Invariant cache hit.
[2024-05-23 08:11:53] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 604ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 313 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 562480 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 562480 steps, saw 344903 distinct states, run finished after 3002 ms. (steps per millisecond=187 ) properties seen :0
[2024-05-23 08:11:57] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:11:57] [INFO ] Invariant cache hit.
[2024-05-23 08:11:57] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 401 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 52 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 46 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 08:11:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:11:58] [INFO ] Invariant cache hit.
[2024-05-23 08:11:58] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-23 08:11:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:11:58] [INFO ] Invariant cache hit.
[2024-05-23 08:11:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:11:59] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2024-05-23 08:11:59] [INFO ] Redundant transitions in 18 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 08:11:59] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:11:59] [INFO ] Invariant cache hit.
[2024-05-23 08:11:59] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64794ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64806ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66338 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
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 697 place count 339 transition count 606
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 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
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 1397 place count 21 transition count 34
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 1399 place count 20 transition count 33
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 1401 place count 19 transition count 33
Applied a total of 1401 rules in 26 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 08:13:04] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 08:13:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 08:13:04] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 08:13:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 08:13:04] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:13:04] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:13:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 08:13:04] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 08:13:04] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 08:13:04] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 08:13:04] [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 100 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[153] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-07 in 364799 ms.
Starting property specific reduction for FunctionPointer-PT-c128-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-23 08:13:04] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
// Phase 1: matrix 762 rows 467 cols
[2024-05-23 08:13:04] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 20 ms. (476 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-23 08:13:04] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 08:13:04] [INFO ] Invariant cache hit.
[2024-05-23 08:13:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 08:13:04] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 08:13:04] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 08:13:04] [INFO ] [Real]Added 91 Read/Feed constraints in 30 ms returned sat
[2024-05-23 08:13:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:13:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:13:05] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-23 08:13:05] [INFO ] [Nat]Added 91 Read/Feed constraints in 58 ms returned sat
[2024-05-23 08:13:05] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 65 ms.
[2024-05-23 08:13:05] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 260 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 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 461 transition count 1312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 461 transition count 1312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 461 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 455 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 455 transition count 1296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 449 transition count 1278
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 449 transition count 1278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 444 transition count 1266
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 444 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 439 transition count 1256
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 439 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 434 transition count 1244
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 434 transition count 1244
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 429 transition count 1234
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 429 transition count 1234
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 424 transition count 1224
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 424 transition count 1224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 419 transition count 1214
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 419 transition count 1214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 417 transition count 1210
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 416 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 415 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 415 transition count 1206
Applied a total of 108 rules in 141 ms. Remains 415 /467 variables (removed 52) and now considering 1206/1324 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 415/467 places, 1206/1324 transitions.
[2024-05-23 08:13:05] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-23 08:13:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2024-05-23 08:13:06] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 1989 ms. (502 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1402 ms. (712 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[536] Max Struct:[+inf]
[2024-05-23 08:13:09] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:13:09] [INFO ] Invariant cache hit.
[2024-05-23 08:13:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:13:09] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-23 08:13:09] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:13:09] [INFO ] [Real]Added 74 Read/Feed constraints in 36 ms returned sat
[2024-05-23 08:13:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:13:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:13:10] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-23 08:13:10] [INFO ] [Nat]Added 74 Read/Feed constraints in 27 ms returned sat
[2024-05-23 08:13:10] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 3 ms to minimize.
[2024-05-23 08:13:10] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 2 ms to minimize.
[2024-05-23 08:13:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2024-05-23 08:13:10] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 60 ms.
[2024-05-23 08:13:11] [INFO ] Deduced a trap composed of 220 places in 172 ms of which 3 ms to minimize.
[2024-05-23 08:13:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-23 08:13:11] [INFO ] Added : 6 causal constraints over 3 iterations in 463 ms. Result :sat
Minimization took 252 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[536] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[536] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 41 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 08:13:14] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:13:14] [INFO ] Invariant cache hit.
[2024-05-23 08:13:14] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-23 08:13:14] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:13:14] [INFO ] Invariant cache hit.
[2024-05-23 08:13:14] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:13:15] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
[2024-05-23 08:13:15] [INFO ] Redundant transitions in 12 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 08:13:15] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:13:15] [INFO ] Invariant cache hit.
[2024-05-23 08:13:15] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 680/1095 variables, 415/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1095 variables, 74/492 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 680/1095 variables, 415/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1095 variables, 74/492 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 1204/1696 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1696 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
After SMT, in 63941ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 63951ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65435 ms. Remains : 415/415 places, 1206/1206 transitions.
[2024-05-23 08:14:19] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[536] Max Struct:[+inf]
[2024-05-23 08:14:20] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:14:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[536] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1980 ms. (504 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1382 ms. (723 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[536] Max Struct:[+inf]
[2024-05-23 08:14:23] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:14:23] [INFO ] Invariant cache hit.
[2024-05-23 08:14:23] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 08:14:23] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 08:14:23] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:14:23] [INFO ] [Real]Added 74 Read/Feed constraints in 36 ms returned sat
[2024-05-23 08:14:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:14:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:14:23] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-23 08:14:23] [INFO ] [Nat]Added 74 Read/Feed constraints in 27 ms returned sat
[2024-05-23 08:14:24] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 3 ms to minimize.
[2024-05-23 08:14:24] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 2 ms to minimize.
[2024-05-23 08:14:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
[2024-05-23 08:14:24] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 65 ms.
[2024-05-23 08:14:24] [INFO ] Deduced a trap composed of 220 places in 171 ms of which 2 ms to minimize.
[2024-05-23 08:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-23 08:14:24] [INFO ] Added : 6 causal constraints over 3 iterations in 472 ms. Result :sat
Minimization took 290 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[536] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[536] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 08:14:27] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:14:27] [INFO ] Invariant cache hit.
[2024-05-23 08:14:28] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-23 08:14:28] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:14:28] [INFO ] Invariant cache hit.
[2024-05-23 08:14:28] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:14:29] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2024-05-23 08:14:29] [INFO ] Redundant transitions in 21 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 08:14:29] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:14:29] [INFO ] Invariant cache hit.
[2024-05-23 08:14:29] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 680/1095 variables, 415/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1095 variables, 74/492 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 680/1095 variables, 415/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1095 variables, 74/492 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 1204/1696 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1696 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
After SMT, in 64245ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 64255ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65798 ms. Remains : 415/415 places, 1206/1206 transitions.
[2024-05-23 08:15:33] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[536] Max Struct:[+inf]
RANDOM walk for 40005 steps (8 resets) in 97 ms. (408 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 569443 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569443 steps, saw 349174 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-23 08:15:37] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:15:37] [INFO ] Invariant cache hit.
[2024-05-23 08:15:37] [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) 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) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 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) 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) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 389 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 45 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 415/415 places, 1206/1206 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 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 524831 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 524831 steps, saw 321819 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 08:15:41] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:15:41] [INFO ] Invariant cache hit.
[2024-05-23 08:15:41] [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) 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) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 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) 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) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 666ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 403 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 08:15:42] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:15:42] [INFO ] Invariant cache hit.
[2024-05-23 08:15:42] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-23 08:15:42] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:15:42] [INFO ] Invariant cache hit.
[2024-05-23 08:15:42] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:15:43] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2024-05-23 08:15:43] [INFO ] Redundant transitions in 20 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 08:15:43] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 08:15:43] [INFO ] Invariant cache hit.
[2024-05-23 08:15:43] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 680/1095 variables, 415/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1095 variables, 74/492 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 680/1095 variables, 415/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1095 variables, 74/492 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 1204/1696 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1696 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
After SMT, in 63647ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 63658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65162 ms. Remains : 415/415 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 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 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 938 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1002 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1066 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1067 place count 145 transition count 344
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 1069 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1132 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1195 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1258 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1321 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1384 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1384 place count 18 transition count 28
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 1386 place count 17 transition count 28
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 1389 place count 17 transition count 25
Applied a total of 1389 rules in 31 ms. Remains 17 /415 variables (removed 398) and now considering 25/1206 (removed 1181) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2024-05-23 08:16:47] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 08:16:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 08:16:47] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 08:16:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 08:16:47] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:16:47] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:16:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 08:16:47] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 08:16:47] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 08:16:47] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 08:16:47] [INFO ] After 27ms 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:[536] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-09 in 222897 ms.
Starting property specific reduction for FunctionPointer-PT-c128-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-23 08:16:47] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
// Phase 1: matrix 762 rows 467 cols
[2024-05-23 08:16:47] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 19 ms. (500 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-23 08:16:47] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 08:16:47] [INFO ] Invariant cache hit.
[2024-05-23 08:16:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:16:47] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 08:16:47] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 08:16:47] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-23 08:16:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:16:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:16:48] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 08:16:48] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-23 08:16:48] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 70 ms.
[2024-05-23 08:16:48] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 302 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 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 461 transition count 1312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 461 transition count 1312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 461 transition count 1306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 455 transition count 1294
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 455 transition count 1294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 450 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 450 transition count 1278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 445 transition count 1266
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 445 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 440 transition count 1256
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 440 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 435 transition count 1244
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 435 transition count 1244
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 430 transition count 1234
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 430 transition count 1234
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 425 transition count 1224
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 425 transition count 1224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 420 transition count 1214
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 420 transition count 1214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 418 transition count 1210
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 417 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 416 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 416 transition count 1206
Applied a total of 108 rules in 148 ms. Remains 416 /467 variables (removed 51) and now considering 1206/1324 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 416/467 places, 1206/1324 transitions.
[2024-05-23 08:16:48] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 08:16:49] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2024-05-23 08:16:49] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1980 ms. (504 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1418 ms. (704 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[481] Max Struct:[+inf]
[2024-05-23 08:16:52] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:16:52] [INFO ] Invariant cache hit.
[2024-05-23 08:16:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:16:52] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-23 08:16:52] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:16:52] [INFO ] [Real]Added 74 Read/Feed constraints in 27 ms returned sat
[2024-05-23 08:16:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:16:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:16:53] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-23 08:16:53] [INFO ] [Nat]Added 74 Read/Feed constraints in 30 ms returned sat
[2024-05-23 08:16:53] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 3 ms to minimize.
[2024-05-23 08:16:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-23 08:16:53] [INFO ] Computed and/alt/rep : 330/1240/330 causal constraints (skipped 349 transitions) in 58 ms.
[2024-05-23 08:16:53] [INFO ] Added : 6 causal constraints over 3 iterations in 235 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[481] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[481] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 08:16:55] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:16:55] [INFO ] Invariant cache hit.
[2024-05-23 08:16:55] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-23 08:16:55] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:16:55] [INFO ] Invariant cache hit.
[2024-05-23 08:16:55] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:16:56] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
[2024-05-23 08:16:56] [INFO ] Redundant transitions in 20 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 08:16:56] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:16:56] [INFO ] Invariant cache hit.
[2024-05-23 08:16:56] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 681/1097 variables, 416/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1097 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 681/1097 variables, 416/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1097 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 1204/1697 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
After SMT, in 63990ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 64000ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65576 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-23 08:18:00] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[481] Max Struct:[+inf]
[2024-05-23 08:18:01] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:18:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[481] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2015 ms. (496 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1387 ms. (720 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[528] Max Struct:[+inf]
[2024-05-23 08:18:04] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:18:04] [INFO ] Invariant cache hit.
[2024-05-23 08:18:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:18:04] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-23 08:18:04] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:18:04] [INFO ] [Real]Added 74 Read/Feed constraints in 27 ms returned sat
[2024-05-23 08:18:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:18:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:18:05] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-23 08:18:05] [INFO ] [Nat]Added 74 Read/Feed constraints in 31 ms returned sat
[2024-05-23 08:18:05] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 3 ms to minimize.
[2024-05-23 08:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2024-05-23 08:18:05] [INFO ] Computed and/alt/rep : 330/1240/330 causal constraints (skipped 349 transitions) in 59 ms.
[2024-05-23 08:18:05] [INFO ] Added : 6 causal constraints over 3 iterations in 243 ms. Result :sat
Minimization took 245 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[528] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[528] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 08:18:07] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:18:07] [INFO ] Invariant cache hit.
[2024-05-23 08:18:07] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-23 08:18:07] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:18:07] [INFO ] Invariant cache hit.
[2024-05-23 08:18:08] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:18:09] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
[2024-05-23 08:18:09] [INFO ] Redundant transitions in 18 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 08:18:09] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:18:09] [INFO ] Invariant cache hit.
[2024-05-23 08:18:09] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 681/1097 variables, 416/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1097 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 681/1097 variables, 416/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1097 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 1204/1697 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
After SMT, in 64194ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 64204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65764 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-23 08:19:13] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[528] Max Struct:[+inf]
[2024-05-23 08:19:13] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:19:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[528] 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 1399 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[528] Max Struct:[+inf]
[2024-05-23 08:19:17] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:19:17] [INFO ] Invariant cache hit.
[2024-05-23 08:19:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 08:19:17] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-23 08:19:17] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:19:17] [INFO ] [Real]Added 74 Read/Feed constraints in 26 ms returned sat
[2024-05-23 08:19:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:19:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:19:17] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-23 08:19:17] [INFO ] [Nat]Added 74 Read/Feed constraints in 31 ms returned sat
[2024-05-23 08:19:17] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 2 ms to minimize.
[2024-05-23 08:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-05-23 08:19:17] [INFO ] Computed and/alt/rep : 330/1240/330 causal constraints (skipped 349 transitions) in 72 ms.
[2024-05-23 08:19:18] [INFO ] Added : 6 causal constraints over 3 iterations in 245 ms. Result :sat
Minimization took 249 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[528] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[528] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 45 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 08:19:20] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:19:20] [INFO ] Invariant cache hit.
[2024-05-23 08:19:20] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-23 08:19:20] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:19:20] [INFO ] Invariant cache hit.
[2024-05-23 08:19:20] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:19:21] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2024-05-23 08:19:21] [INFO ] Redundant transitions in 13 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 08:19:21] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:19:21] [INFO ] Invariant cache hit.
[2024-05-23 08:19:21] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 681/1097 variables, 416/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1097 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 681/1097 variables, 416/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1097 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 1204/1697 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
After SMT, in 64329ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 64347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65894 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-23 08:20:26] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[528] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 559571 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 559571 steps, saw 343121 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-23 08:20:29] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:20:29] [INFO ] Invariant cache hit.
[2024-05-23 08:20:29] [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) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/355 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/953 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 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) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/355 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 598/953 variables, 332/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/953 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 621ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1399 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 416/416 places, 1206/1206 transitions.
RANDOM walk for 40001 steps (8 resets) in 101 ms. (392 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 569950 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569950 steps, saw 349485 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-23 08:20:34] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:20:34] [INFO ] Invariant cache hit.
[2024-05-23 08:20:34] [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) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/355 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/953 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 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) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/355 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 598/953 variables, 332/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/953 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 624ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1476 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 60 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 41 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 08:20:36] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:20:36] [INFO ] Invariant cache hit.
[2024-05-23 08:20:37] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-23 08:20:37] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:20:37] [INFO ] Invariant cache hit.
[2024-05-23 08:20:37] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 08:20:38] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2024-05-23 08:20:38] [INFO ] Redundant transitions in 17 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 08:20:38] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 08:20:38] [INFO ] Invariant cache hit.
[2024-05-23 08:20:38] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 681/1097 variables, 416/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1097 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (OVERLAPS) 681/1097 variables, 416/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1097 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 1204/1697 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints]
After SMT, in 64327ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 64337ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65916 ms. Remains : 416/416 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 670
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 405 transition count 670
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 547 place count 405 transition count 601
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 685 place count 336 transition count 601
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 939 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1003 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1067 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1068 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 344
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 1070 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1133 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1196 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1259 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1322 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1385 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 28
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 1387 place count 17 transition count 28
Applied a total of 1387 rules in 46 ms. Remains 17 /416 variables (removed 399) and now considering 28/1206 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 17 cols
[2024-05-23 08:21:42] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 08:21:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 08:21:42] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:21:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 08:21:42] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 08:21:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 08:21:42] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 08:21:42] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 08:21:42] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 117 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[528] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-10 in 295158 ms.
Starting property specific reduction for FunctionPointer-PT-c128-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 08:21:42] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
// Phase 1: matrix 762 rows 467 cols
[2024-05-23 08:21:42] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 21 ms. (454 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-23 08:21:42] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 08:21:42] [INFO ] Invariant cache hit.
[2024-05-23 08:21:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 08:21:42] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 08:21:43] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 08:21:43] [INFO ] [Real]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 08:21:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:21:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 08:21:43] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 08:21:43] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-23 08:21:43] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 81 ms.
[2024-05-23 08:21:43] [INFO ] Added : 6 causal constraints over 3 iterations in 235 ms. Result :sat
Minimization took 271 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 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 461 transition count 1312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 461 transition count 1312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 461 transition count 1306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 455 transition count 1294
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 455 transition count 1294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 450 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 450 transition count 1280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 446 transition count 1270
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 446 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 442 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 438 transition count 1252
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 438 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 434 transition count 1244
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 434 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 430 transition count 1236
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 430 transition count 1236
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 426 transition count 1228
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 424 transition count 1224
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 422 transition count 1220
Applied a total of 96 rules in 144 ms. Remains 422 /467 variables (removed 45) and now considering 1220/1324 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 422/467 places, 1220/1324 transitions.
[2024-05-23 08:21:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 08:21:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 08:21:44] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2043 ms. (489 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1432 ms. (697 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[147] Max Struct:[+inf]
[2024-05-23 08:21:47] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:21:47] [INFO ] Invariant cache hit.
[2024-05-23 08:21:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:21:47] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-23 08:21:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:21:48] [INFO ] [Real]Added 75 Read/Feed constraints in 41 ms returned sat
[2024-05-23 08:21:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:21:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:21:48] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-23 08:21:48] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 08:21:48] [INFO ] Deduced a trap composed of 113 places in 184 ms of which 2 ms to minimize.
[2024-05-23 08:21:48] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 3 ms to minimize.
[2024-05-23 08:21:48] [INFO ] Deduced a trap composed of 87 places in 183 ms of which 2 ms to minimize.
[2024-05-23 08:21:49] [INFO ] Deduced a trap composed of 85 places in 178 ms of which 3 ms to minimize.
[2024-05-23 08:21:49] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 3 ms to minimize.
[2024-05-23 08:21:49] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 3 ms to minimize.
[2024-05-23 08:21:49] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 3 ms to minimize.
[2024-05-23 08:21:49] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 3 ms to minimize.
[2024-05-23 08:21:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1616 ms
[2024-05-23 08:21:49] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 61 ms.
[2024-05-23 08:21:50] [INFO ] Added : 15 causal constraints over 6 iterations in 394 ms. Result :sat
Minimization took 270 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[147] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[147] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 08:21:52] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:21:52] [INFO ] Invariant cache hit.
[2024-05-23 08:21:52] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-23 08:21:52] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:21:52] [INFO ] Invariant cache hit.
[2024-05-23 08:21:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:21:53] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2024-05-23 08:21:53] [INFO ] Redundant transitions in 17 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 08:21:53] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:21:53] [INFO ] Invariant cache hit.
[2024-05-23 08:21:53] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64257ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64269ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65774 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 08:22:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[147] Max Struct:[+inf]
[2024-05-23 08:22:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:22:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[147] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2032 ms. (491 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1440 ms. (693 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[147] Max Struct:[+inf]
[2024-05-23 08:23:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:23:01] [INFO ] Invariant cache hit.
[2024-05-23 08:23:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:23:02] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-23 08:23:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:23:02] [INFO ] [Real]Added 75 Read/Feed constraints in 41 ms returned sat
[2024-05-23 08:23:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:23:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:23:02] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 08:23:02] [INFO ] [Nat]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-23 08:23:02] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 3 ms to minimize.
[2024-05-23 08:23:02] [INFO ] Deduced a trap composed of 109 places in 174 ms of which 3 ms to minimize.
[2024-05-23 08:23:03] [INFO ] Deduced a trap composed of 87 places in 180 ms of which 2 ms to minimize.
[2024-05-23 08:23:03] [INFO ] Deduced a trap composed of 85 places in 180 ms of which 2 ms to minimize.
[2024-05-23 08:23:03] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 3 ms to minimize.
[2024-05-23 08:23:03] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 2 ms to minimize.
[2024-05-23 08:23:03] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 3 ms to minimize.
[2024-05-23 08:23:04] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 3 ms to minimize.
[2024-05-23 08:23:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1643 ms
[2024-05-23 08:23:04] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 61 ms.
[2024-05-23 08:23:04] [INFO ] Added : 15 causal constraints over 6 iterations in 381 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[147] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[147] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 08:23:06] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:23:06] [INFO ] Invariant cache hit.
[2024-05-23 08:23:06] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-23 08:23:06] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:23:06] [INFO ] Invariant cache hit.
[2024-05-23 08:23:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:23:07] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
[2024-05-23 08:23:08] [INFO ] Redundant transitions in 15 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 08:23:08] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:23:08] [INFO ] Invariant cache hit.
[2024-05-23 08:23:08] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64023ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64033ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65551 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 08:24:12] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[147] Max Struct:[+inf]
RANDOM walk for 40015 steps (8 resets) in 101 ms. (392 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 587296 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 1
Probabilistic random walk after 587296 steps, saw 360118 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2024-05-23 08:24:15] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:24:15] [INFO ] Invariant cache hit.
[2024-05-23 08:24:15] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 562ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 751 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40000 steps (8 resets) in 121 ms. (327 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 569210 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569210 steps, saw 349030 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-23 08:24:19] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:24:19] [INFO ] Invariant cache hit.
[2024-05-23 08:24:19] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 786 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 08:24:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:24:21] [INFO ] Invariant cache hit.
[2024-05-23 08:24:21] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-23 08:24:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:24:21] [INFO ] Invariant cache hit.
[2024-05-23 08:24:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 08:24:22] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
[2024-05-23 08:24:22] [INFO ] Redundant transitions in 18 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 08:24:22] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 08:24:22] [INFO ] Invariant cache hit.
[2024-05-23 08:24:22] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64181ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64190ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65687 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
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 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
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 1397 place count 21 transition count 34
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 1399 place count 20 transition count 33
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 1401 place count 19 transition count 33
Applied a total of 1401 rules in 27 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 08:25:26] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 08:25:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 08:25:26] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 08:25:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 08:25:26] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:25:26] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:25:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 08:25:26] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 08:25:26] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 08:25:26] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 08:25:26] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 88 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[147] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-13 in 224219 ms.
Starting property specific reduction for FunctionPointer-PT-c128-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[128]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[128]
[2024-05-23 08:25:26] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
// Phase 1: matrix 762 rows 467 cols
[2024-05-23 08:25:26] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[128]
RANDOM walk for 10000 steps (2 resets) in 21 ms. (454 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:[128]
[2024-05-23 08:25:26] [INFO ] Flow matrix only has 762 transitions (discarded 562 similar events)
[2024-05-23 08:25:26] [INFO ] Invariant cache hit.
[2024-05-23 08:25:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:25:27] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 08:25:27] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 08:25:27] [INFO ] [Real]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 08:25:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:25:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:25:27] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 08:25:27] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 08:25:27] [INFO ] Computed and/alt/rep : 109/225/95 causal constraints (skipped 665 transitions) in 66 ms.
[2024-05-23 08:25:27] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[127] Max Struct:[128]
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1324/1324 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 460 transition count 1310
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 460 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 460 transition count 1304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 453 transition count 1290
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 453 transition count 1290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 447 transition count 1272
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 447 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 442 transition count 1260
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 442 transition count 1260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 437 transition count 1250
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 432 transition count 1238
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 432 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 427 transition count 1228
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 427 transition count 1228
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 422 transition count 1218
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 422 transition count 1218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 417 transition count 1208
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 417 transition count 1208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 415 transition count 1204
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 414 transition count 1202
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 413 transition count 1200
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 413 transition count 1200
Applied a total of 114 rules in 152 ms. Remains 413 /467 variables (removed 54) and now considering 1200/1324 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 413/467 places, 1200/1324 transitions.
[2024-05-23 08:25:28] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-23 08:25:28] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[127] Max Struct:[128]
RANDOM walk for 1000002 steps (2 resets) in 1956 ms. (510 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1306 ms. (765 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[127] Max Struct:[128]
[2024-05-23 08:25:31] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 08:25:31] [INFO ] Invariant cache hit.
[2024-05-23 08:25:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:25:32] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-23 08:25:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 08:25:32] [INFO ] [Real]Added 72 Read/Feed constraints in 33 ms returned sat
[2024-05-23 08:25:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 08:25:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 08:25:32] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-23 08:25:32] [INFO ] [Nat]Added 72 Read/Feed constraints in 25 ms returned sat
[2024-05-23 08:25:32] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 63 ms.
[2024-05-23 08:25:32] [INFO ] Added : 2 causal constraints over 1 iterations in 139 ms. Result :sat
Minimization took 233 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[127] Max Struct:[128]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[127] Max Struct:[128]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 41 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 08:25:33] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 08:25:33] [INFO ] Invariant cache hit.
[2024-05-23 08:25:33] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-23 08:25:33] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 08:25:33] [INFO ] Invariant cache hit.
[2024-05-23 08:25:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 08:25:34] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
[2024-05-23 08:25:34] [INFO ] Redundant transitions in 15 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 08:25:34] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 08:25:34] [INFO ] Invariant cache hit.
[2024-05-23 08:25:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 1198/1686 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1686 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
After SMT, in 64074ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 64084ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65485 ms. Remains : 413/413 places, 1200/1200 transitions.
RANDOM walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 396519 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 2
Probabilistic random walk after 396519 steps, saw 243148 distinct states, run finished after 3005 ms. (steps per millisecond=131 ) properties seen :0
[2024-05-23 08:26:41] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 08:26:41] [INFO ] Invariant cache hit.
[2024-05-23 08:26:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/1049 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1066 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1074 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/1082 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/1088 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1049 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/1066 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1074 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1082 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/1088 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 918 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 413/413 places, 1200/1200 transitions.
RANDOM walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 366306 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 2
Probabilistic random walk after 366306 steps, saw 224621 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-23 08:26:46] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 08:26:46] [INFO ] Invariant cache hit.
[2024-05-23 08:26:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/1049 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1066 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1074 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/1082 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/1088 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1049 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/1066 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1074 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1082 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/1088 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1006ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1418 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 08:26:49] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 08:26:49] [INFO ] Invariant cache hit.
[2024-05-23 08:26:49] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-23 08:26:49] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 08:26:49] [INFO ] Invariant cache hit.
[2024-05-23 08:26:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 08:26:50] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2024-05-23 08:26:50] [INFO ] Redundant transitions in 19 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 08:26:50] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 08:26:50] [INFO ] Invariant cache hit.
[2024-05-23 08:26:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 675/1088 variables, 413/416 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 1198/1686 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1686 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints]
After SMT, in 63634ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 63644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65043 ms. Remains : 413/413 places, 1200/1200 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 413 transition count 664
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 402 transition count 664
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 547 place count 402 transition count 597
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 681 place count 335 transition count 597
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 933 place count 209 transition count 471
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 996 place count 146 transition count 345
Iterating global reduction 2 with 63 rules applied. Total rules applied 1059 place count 146 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1060 place count 146 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1060 place count 146 transition count 343
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 1062 place count 145 transition count 343
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1124 place count 83 transition count 219
Iterating global reduction 3 with 62 rules applied. Total rules applied 1186 place count 83 transition count 219
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1248 place count 21 transition count 95
Iterating global reduction 3 with 62 rules applied. Total rules applied 1310 place count 21 transition count 95
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1372 place count 21 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 1374 place count 20 transition count 34
Applied a total of 1374 rules in 17 ms. Remains 20 /413 variables (removed 393) and now considering 34/1200 (removed 1166) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 08:27:54] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 08:27:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 08:27:54] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 08:27:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 08:27:54] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 08:27:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 08:27:54] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 08:27:54] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 08:27:54] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 90 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[127] Max Struct:[128]
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-15 in 147180 ms.
[2024-05-23 08:27:54] [INFO ] Flatten gal took : 114 ms
[2024-05-23 08:27:54] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-23 08:27:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 467 places, 1324 transitions and 5422 arcs took 10 ms.
Total runtime 2979026 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FunctionPointer-PT-c128
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 467
TRANSITIONS: 1324
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.029s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2774
MODEL NAME: /home/mcc/execution/411/model
467 places, 1324 transitions.
Enabling coverability test.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 15 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716453052650
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-c128, 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 r179-tall-171640601300325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c128.tgz
mv FunctionPointer-PT-c128 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 ;