About the Execution of GreatSPN+red for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8692.048 | 1722847.00 | 2218562.00 | 3873.10 | 0 16 ? 0 16 ? 0 0 ? ? ? ? ? 16 ? 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601200301.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-c016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200301
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716441951187
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-c016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 05:25:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 05:25:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 05:25:52] [INFO ] Load time of PNML (sax parser for PT used): 413 ms
[2024-05-23 05:25:52] [INFO ] Transformed 2826 places.
[2024-05-23 05:25:52] [INFO ] Transformed 8960 transitions.
[2024-05-23 05:25:52] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 569 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 1198 places in 42 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 05:25:53] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 05:25:53] [INFO ] Computed 4 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 10013 steps (2 resets) in 262 ms. (38 steps per ms)
BEST_FIRST walk for 110011 steps (34 resets) in 258 ms. (424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0, 3, 0, 1, 1, 2, 1, 1, 1, 7] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:25:53] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-23 05:25:53] [INFO ] Invariant cache hit.
[2024-05-23 05:25:54] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:25:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:25:55] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2024-05-23 05:25:55] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-23 05:25:55] [INFO ] [Real]Added 479 Read/Feed constraints in 161 ms returned sat
[2024-05-23 05:25:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:25:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:25:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:25:56] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2024-05-23 05:25:56] [INFO ] [Nat]Added 479 Read/Feed constraints in 96 ms returned sat
[2024-05-23 05:25:57] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 772 ms.
[2024-05-23 05:25:57] [INFO ] Added : 0 causal constraints over 0 iterations in 1041 ms. Result :sat
Minimization took 582 ms.
[2024-05-23 05:25:58] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 05:25:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:25:59] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2024-05-23 05:25:59] [INFO ] [Real]Added 479 Read/Feed constraints in 160 ms returned sat
[2024-05-23 05:25:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:25:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:25:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:00] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2024-05-23 05:26:00] [INFO ] [Nat]Added 479 Read/Feed constraints in 144 ms returned sat
[2024-05-23 05:26:01] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 473 ms.
[2024-05-23 05:26:01] [INFO ] Added : 2 causal constraints over 1 iterations in 841 ms. Result :sat
Minimization took 577 ms.
[2024-05-23 05:26:02] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 05:26:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:26:03] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2024-05-23 05:26:03] [INFO ] [Real]Added 479 Read/Feed constraints in 119 ms returned sat
[2024-05-23 05:26:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:26:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:04] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2024-05-23 05:26:04] [INFO ] [Nat]Added 479 Read/Feed constraints in 96 ms returned sat
[2024-05-23 05:26:05] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 470 ms.
[2024-05-23 05:26:05] [INFO ] Added : 0 causal constraints over 0 iterations in 669 ms. Result :sat
Minimization took 584 ms.
[2024-05-23 05:26:06] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 05:26:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:06] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2024-05-23 05:26:07] [INFO ] [Real]Added 479 Read/Feed constraints in 138 ms returned sat
[2024-05-23 05:26:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:26:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:26:08] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2024-05-23 05:26:08] [INFO ] [Nat]Added 479 Read/Feed constraints in 140 ms returned sat
[2024-05-23 05:26:09] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 474 ms.
[2024-05-23 05:26:10] [INFO ] Deduced a trap composed of 142 places in 1230 ms of which 87 ms to minimize.
[2024-05-23 05:26:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1488 ms
[2024-05-23 05:26:10] [INFO ] Added : 2 causal constraints over 1 iterations in 2406 ms. Result :sat
Minimization took 580 ms.
[2024-05-23 05:26:11] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 05:26:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:12] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2024-05-23 05:26:12] [INFO ] [Real]Added 479 Read/Feed constraints in 125 ms returned sat
[2024-05-23 05:26:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:26:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:13] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2024-05-23 05:26:13] [INFO ] [Nat]Added 479 Read/Feed constraints in 132 ms returned sat
[2024-05-23 05:26:14] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 459 ms.
[2024-05-23 05:26:14] [INFO ] Added : 2 causal constraints over 1 iterations in 784 ms. Result :sat
Minimization took 592 ms.
[2024-05-23 05:26:15] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:26:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:16] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2024-05-23 05:26:16] [INFO ] [Real]Added 479 Read/Feed constraints in 183 ms returned sat
[2024-05-23 05:26:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:26:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:17] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2024-05-23 05:26:17] [INFO ] [Nat]Added 479 Read/Feed constraints in 132 ms returned sat
[2024-05-23 05:26:18] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 424 ms.
[2024-05-23 05:26:18] [INFO ] Added : 2 causal constraints over 1 iterations in 761 ms. Result :sat
Minimization took 602 ms.
[2024-05-23 05:26:19] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 05:26:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:26:20] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2024-05-23 05:26:20] [INFO ] [Real]Added 479 Read/Feed constraints in 124 ms returned sat
[2024-05-23 05:26:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 05:26:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:21] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2024-05-23 05:26:21] [INFO ] [Nat]Added 479 Read/Feed constraints in 100 ms returned sat
[2024-05-23 05:26:22] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 453 ms.
[2024-05-23 05:26:22] [INFO ] Added : 1 causal constraints over 1 iterations in 779 ms. Result :sat
Minimization took 592 ms.
[2024-05-23 05:26:23] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 05:26:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:23] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2024-05-23 05:26:24] [INFO ] [Real]Added 479 Read/Feed constraints in 108 ms returned sat
[2024-05-23 05:26:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-23 05:26:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 05:26:25] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2024-05-23 05:26:25] [INFO ] [Nat]Added 479 Read/Feed constraints in 292 ms returned sat
[2024-05-23 05:26:26] [INFO ] Deduced a trap composed of 147 places in 1194 ms of which 11 ms to minimize.
[2024-05-23 05:26:28] [INFO ] Deduced a trap composed of 141 places in 1228 ms of which 14 ms to minimize.
[2024-05-23 05:26:29] [INFO ] Deduced a trap composed of 136 places in 1233 ms of which 11 ms to minimize.
[2024-05-23 05:26:29] [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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 05:26:29] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 05:26:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:30] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2024-05-23 05:26:30] [INFO ] [Real]Added 479 Read/Feed constraints in 166 ms returned sat
[2024-05-23 05:26:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:26:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:26:31] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2024-05-23 05:26:31] [INFO ] [Nat]Added 479 Read/Feed constraints in 116 ms returned sat
[2024-05-23 05:26:32] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 430 ms.
[2024-05-23 05:26:32] [INFO ] Added : 1 causal constraints over 1 iterations in 775 ms. Result :sat
Minimization took 600 ms.
[2024-05-23 05:26:33] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 05:26:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:34] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2024-05-23 05:26:34] [INFO ] [Real]Added 479 Read/Feed constraints in 140 ms returned sat
[2024-05-23 05:26:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:26:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:26:35] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2024-05-23 05:26:35] [INFO ] [Nat]Added 479 Read/Feed constraints in 155 ms returned sat
[2024-05-23 05:26:36] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 424 ms.
[2024-05-23 05:26:36] [INFO ] Added : 2 causal constraints over 1 iterations in 750 ms. Result :sat
Minimization took 595 ms.
[2024-05-23 05:26:37] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 05:26:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:38] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2024-05-23 05:26:38] [INFO ] [Real]Added 479 Read/Feed constraints in 121 ms returned sat
[2024-05-23 05:26:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 05:26:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:39] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2024-05-23 05:26:39] [INFO ] [Nat]Added 479 Read/Feed constraints in 129 ms returned sat
[2024-05-23 05:26:39] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 413 ms.
[2024-05-23 05:26:40] [INFO ] Added : 2 causal constraints over 1 iterations in 734 ms. Result :sat
Minimization took 586 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0, 3, 0, 1, 1, 2, 1, 1, 1, 7] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 3, 0, 1, 1, 2, 1, 1, 1, 7] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 11 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.14 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1422 transition count 5583
Discarding 300 places :
Symmetric choice reduction at 1 with 300 rule applications. Total rules 680 place count 1122 transition count 3289
Iterating global reduction 1 with 300 rules applied. Total rules applied 980 place count 1122 transition count 3289
Ensure Unique test removed 350 transitions
Reduce isomorphic transitions removed 350 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 1330 place count 1122 transition count 2939
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1484 place count 968 transition count 2631
Iterating global reduction 2 with 154 rules applied. Total rules applied 1638 place count 968 transition count 2631
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1698 place count 968 transition count 2571
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1712 place count 954 transition count 2543
Iterating global reduction 3 with 14 rules applied. Total rules applied 1726 place count 954 transition count 2543
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1740 place count 940 transition count 2515
Iterating global reduction 3 with 14 rules applied. Total rules applied 1754 place count 940 transition count 2515
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1768 place count 926 transition count 2487
Iterating global reduction 3 with 14 rules applied. Total rules applied 1782 place count 926 transition count 2487
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1796 place count 912 transition count 2459
Iterating global reduction 3 with 14 rules applied. Total rules applied 1810 place count 912 transition count 2459
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1824 place count 898 transition count 2431
Iterating global reduction 3 with 14 rules applied. Total rules applied 1838 place count 898 transition count 2431
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1850 place count 886 transition count 2407
Iterating global reduction 3 with 12 rules applied. Total rules applied 1862 place count 886 transition count 2407
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1874 place count 874 transition count 2383
Iterating global reduction 3 with 12 rules applied. Total rules applied 1886 place count 874 transition count 2383
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1932 place count 828 transition count 2213
Iterating global reduction 3 with 46 rules applied. Total rules applied 1978 place count 828 transition count 2213
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2037 place count 769 transition count 1977
Iterating global reduction 3 with 59 rules applied. Total rules applied 2096 place count 769 transition count 1977
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2154 place count 711 transition count 1823
Iterating global reduction 3 with 58 rules applied. Total rules applied 2212 place count 711 transition count 1823
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2270 place count 653 transition count 1707
Iterating global reduction 3 with 58 rules applied. Total rules applied 2328 place count 653 transition count 1707
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2386 place count 595 transition count 1591
Iterating global reduction 3 with 58 rules applied. Total rules applied 2444 place count 595 transition count 1591
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2502 place count 537 transition count 1475
Iterating global reduction 3 with 58 rules applied. Total rules applied 2560 place count 537 transition count 1475
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2616 place count 481 transition count 1363
Iterating global reduction 3 with 56 rules applied. Total rules applied 2672 place count 481 transition count 1363
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 2691 place count 462 transition count 1325
Iterating global reduction 3 with 19 rules applied. Total rules applied 2710 place count 462 transition count 1325
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 2722 place count 462 transition count 1313
Applied a total of 2722 rules in 1114 ms. Remains 462 /1628 variables (removed 1166) and now considering 1313/5962 (removed 4649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1138 ms. Remains : 462/1628 places, 1313/5962 transitions.
[2024-05-23 05:26:41] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 3 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 11) seen :[0, 1, 1, 3, 0, 2, 2, 4, 3, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 1, 3, 3, 1, 2, 2, 4, 3, 1, 7] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:26:42] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-23 05:26:42] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 1, 3, 3, 1, 2, 2, 4, 3, 1, 7] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2445 ms. (408 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 9288 ms. (1184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 4, 3, 149, 185, 89, 729, 9, 11, 1, 164] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:26:54] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:26:54] [INFO ] Invariant cache hit.
[2024-05-23 05:26:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:26:54] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 05:26:54] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:26:54] [INFO ] [Real]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-23 05:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:26:54] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-23 05:26:54] [INFO ] [Nat]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-23 05:26:54] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 70 ms.
[2024-05-23 05:26:54] [INFO ] Added : 0 causal constraints over 0 iterations in 140 ms. Result :sat
Minimization took 293 ms.
[2024-05-23 05:26:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:26:55] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 05:26:55] [INFO ] [Real]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:26:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:26:55] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-23 05:26:55] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:26:56] [INFO ] Deduced a trap composed of 120 places in 209 ms of which 3 ms to minimize.
[2024-05-23 05:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-23 05:26:56] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-23 05:26:56] [INFO ] Added : 12 causal constraints over 4 iterations in 283 ms. Result :sat
Minimization took 278 ms.
[2024-05-23 05:26:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:26:56] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-23 05:26:56] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2024-05-23 05:26:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:26:57] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 05:26:57] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-23 05:26:57] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 77 ms.
[2024-05-23 05:26:57] [INFO ] Added : 0 causal constraints over 0 iterations in 136 ms. Result :sat
Minimization took 272 ms.
[2024-05-23 05:26:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:26:57] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 05:26:58] [INFO ] [Real]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:26:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:26:58] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-23 05:26:58] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:26:58] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 73 ms.
[2024-05-23 05:26:58] [INFO ] Added : 6 causal constraints over 3 iterations in 251 ms. Result :sat
Minimization took 308 ms.
[2024-05-23 05:26:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:26:59] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 05:26:59] [INFO ] [Real]Added 94 Read/Feed constraints in 71 ms returned sat
[2024-05-23 05:26:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:26:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:26:59] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 05:26:59] [INFO ] [Nat]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-23 05:26:59] [INFO ] Deduced a trap composed of 90 places in 210 ms of which 3 ms to minimize.
[2024-05-23 05:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2024-05-23 05:26:59] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 71 ms.
[2024-05-23 05:27:00] [INFO ] Added : 12 causal constraints over 4 iterations in 268 ms. Result :sat
Minimization took 316 ms.
[2024-05-23 05:27:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:00] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 05:27:00] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:27:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:00] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:27:01] [INFO ] [Nat]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:27:01] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 84 ms.
[2024-05-23 05:27:01] [INFO ] Added : 7 causal constraints over 2 iterations in 236 ms. Result :sat
Minimization took 303 ms.
[2024-05-23 05:27:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:01] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:27:01] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:27:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:02] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 05:27:02] [INFO ] [Nat]Added 94 Read/Feed constraints in 48 ms returned sat
[2024-05-23 05:27:02] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 72 ms.
[2024-05-23 05:27:02] [INFO ] Added : 1 causal constraints over 1 iterations in 184 ms. Result :sat
Minimization took 300 ms.
[2024-05-23 05:27:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:02] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-23 05:27:03] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-23 05:27:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:03] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 05:27:03] [INFO ] [Nat]Added 94 Read/Feed constraints in 62 ms returned sat
[2024-05-23 05:27:03] [INFO ] Deduced a trap composed of 87 places in 204 ms of which 3 ms to minimize.
[2024-05-23 05:27:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2024-05-23 05:27:03] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 73 ms.
[2024-05-23 05:27:03] [INFO ] Added : 2 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 332 ms.
[2024-05-23 05:27:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:27:04] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 05:27:04] [INFO ] [Real]Added 94 Read/Feed constraints in 42 ms returned sat
[2024-05-23 05:27:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:04] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 05:27:04] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 05:27:04] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 71 ms.
[2024-05-23 05:27:04] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 300 ms.
[2024-05-23 05:27:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:05] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 05:27:05] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:27:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:05] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-23 05:27:05] [INFO ] [Nat]Added 94 Read/Feed constraints in 43 ms returned sat
[2024-05-23 05:27:05] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 63 ms.
[2024-05-23 05:27:06] [INFO ] Added : 1 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 315 ms.
[2024-05-23 05:27:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:06] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 05:27:06] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-23 05:27:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:06] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 05:27:06] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:27:07] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 74 ms.
[2024-05-23 05:27:07] [INFO ] Added : 10 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 279 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 4, 3, 149, 185, 89, 729, 9, 11, 1, 164] Max Struct:[16, +inf, 16, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
FORMULA FunctionPointer-PT-c016-UpperBounds-04 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 4, 149, 185, 89, 729, 15, 11, 15, 164] Max Struct:[16, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 10 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 54 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-23 05:27:07] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :[0, 4, 2, 5, 2, 0, 0, 0, 0, 2]
FORMULA FunctionPointer-PT-c016-UpperBounds-01 16 TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 149, 185, 89, 729, 15, 11, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:27:08] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:27:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 149, 185, 89, 729, 15, 11, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2429 ms. (411 steps per ms)
BEST_FIRST walk for 9000008 steps (18 resets) in 7526 ms. (1195 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[110, 149, 185, 89, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:27:18] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:27:18] [INFO ] Invariant cache hit.
[2024-05-23 05:27:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:27:18] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 05:27:18] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:27:18] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:18] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 05:27:18] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-23 05:27:18] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 81 ms.
[2024-05-23 05:27:18] [INFO ] Added : 3 causal constraints over 1 iterations in 198 ms. Result :sat
Minimization took 278 ms.
[2024-05-23 05:27:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:19] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-23 05:27:19] [INFO ] [Real]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:27:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:19] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-23 05:27:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:27:19] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 74 ms.
[2024-05-23 05:27:20] [INFO ] Added : 6 causal constraints over 3 iterations in 239 ms. Result :sat
Minimization took 307 ms.
[2024-05-23 05:27:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:27:20] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 05:27:20] [INFO ] [Real]Added 94 Read/Feed constraints in 69 ms returned sat
[2024-05-23 05:27:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:20] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 05:27:21] [INFO ] [Nat]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-23 05:27:21] [INFO ] Deduced a trap composed of 90 places in 229 ms of which 3 ms to minimize.
[2024-05-23 05:27:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-05-23 05:27:21] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-23 05:27:21] [INFO ] Added : 12 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 296 ms.
[2024-05-23 05:27:21] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:27:22] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 05:27:22] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:27:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:22] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:27:22] [INFO ] [Nat]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:27:22] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 69 ms.
[2024-05-23 05:27:22] [INFO ] Added : 7 causal constraints over 2 iterations in 212 ms. Result :sat
Minimization took 300 ms.
[2024-05-23 05:27:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:23] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-23 05:27:23] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2024-05-23 05:27:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:23] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 05:27:23] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:27:23] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-23 05:27:23] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 274 ms.
[2024-05-23 05:27:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:27:24] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 05:27:24] [INFO ] [Real]Added 94 Read/Feed constraints in 48 ms returned sat
[2024-05-23 05:27:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:24] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-23 05:27:24] [INFO ] [Nat]Added 94 Read/Feed constraints in 65 ms returned sat
[2024-05-23 05:27:24] [INFO ] Deduced a trap composed of 87 places in 199 ms of which 3 ms to minimize.
[2024-05-23 05:27:25] [INFO ] Deduced a trap composed of 131 places in 178 ms of which 3 ms to minimize.
[2024-05-23 05:27:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2024-05-23 05:27:25] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 79 ms.
[2024-05-23 05:27:25] [INFO ] Added : 2 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 329 ms.
[2024-05-23 05:27:25] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:27:25] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 05:27:26] [INFO ] [Real]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-23 05:27:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:26] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-23 05:27:26] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:27:26] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 77 ms.
[2024-05-23 05:27:26] [INFO ] Added : 1 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 304 ms.
[2024-05-23 05:27:26] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:27:27] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 05:27:27] [INFO ] [Real]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-23 05:27:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:27:27] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-23 05:27:27] [INFO ] [Nat]Added 94 Read/Feed constraints in 48 ms returned sat
[2024-05-23 05:27:27] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 76 ms.
[2024-05-23 05:27:27] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 282 ms.
[2024-05-23 05:27:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:28] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 05:27:28] [INFO ] [Real]Added 94 Read/Feed constraints in 43 ms returned sat
[2024-05-23 05:27:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:27:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:27:28] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 05:27:28] [INFO ] [Nat]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-23 05:27:28] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 72 ms.
[2024-05-23 05:27:28] [INFO ] Added : 10 causal constraints over 4 iterations in 256 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[110, 149, 185, 89, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[110, 149, 185, 89, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 53 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 55 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-23 05:27:29] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:27:29] [INFO ] Invariant cache hit.
[2024-05-23 05:27:29] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-23 05:27:29] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:27:29] [INFO ] Invariant cache hit.
[2024-05-23 05:27:29] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:27:31] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2024-05-23 05:27:31] [INFO ] Redundant transitions in 92 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-23 05:27:31] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:27:31] [INFO ] Invariant cache hit.
[2024-05-23 05:27:31] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-23 05:27:47] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64430ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66449 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-23 05:28:35] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :[0, 3, 0, 2, 2, 0, 3, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[110, 149, 185, 89, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:28:36] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:28:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[110, 149, 185, 89, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2428 ms. (411 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 7583 ms. (1186 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[294, 149, 185, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:28:46] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:28:46] [INFO ] Invariant cache hit.
[2024-05-23 05:28:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:28:46] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 05:28:46] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:28:46] [INFO ] [Real]Added 94 Read/Feed constraints in 58 ms returned sat
[2024-05-23 05:28:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:28:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:46] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 05:28:46] [INFO ] [Nat]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-23 05:28:46] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 78 ms.
[2024-05-23 05:28:46] [INFO ] Added : 3 causal constraints over 1 iterations in 193 ms. Result :sat
Minimization took 273 ms.
[2024-05-23 05:28:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:28:47] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-23 05:28:47] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:28:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:28:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:47] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-23 05:28:47] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 05:28:47] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-23 05:28:48] [INFO ] Added : 6 causal constraints over 3 iterations in 222 ms. Result :sat
Minimization took 266 ms.
[2024-05-23 05:28:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:28:48] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 05:28:48] [INFO ] [Real]Added 94 Read/Feed constraints in 79 ms returned sat
[2024-05-23 05:28:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:28:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:48] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-05-23 05:28:49] [INFO ] [Nat]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-23 05:28:49] [INFO ] Deduced a trap composed of 90 places in 218 ms of which 3 ms to minimize.
[2024-05-23 05:28:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-05-23 05:28:49] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 84 ms.
[2024-05-23 05:28:49] [INFO ] Added : 12 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 275 ms.
[2024-05-23 05:28:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:28:50] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 05:28:50] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:28:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:28:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:28:50] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 05:28:50] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:28:50] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 81 ms.
[2024-05-23 05:28:50] [INFO ] Added : 7 causal constraints over 2 iterations in 234 ms. Result :sat
Minimization took 266 ms.
[2024-05-23 05:28:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:28:51] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-23 05:28:51] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:28:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:28:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 05:28:51] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:28:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-23 05:28:51] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 62 ms.
[2024-05-23 05:28:51] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 269 ms.
[2024-05-23 05:28:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:52] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 05:28:52] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-23 05:28:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:28:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-23 05:28:52] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 05:28:52] [INFO ] [Nat]Added 94 Read/Feed constraints in 63 ms returned sat
[2024-05-23 05:28:53] [INFO ] Deduced a trap composed of 87 places in 220 ms of which 3 ms to minimize.
[2024-05-23 05:28:53] [INFO ] Deduced a trap composed of 131 places in 248 ms of which 3 ms to minimize.
[2024-05-23 05:28:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 562 ms
[2024-05-23 05:28:53] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 80 ms.
[2024-05-23 05:28:53] [INFO ] Added : 2 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 299 ms.
[2024-05-23 05:28:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:54] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-23 05:28:54] [INFO ] [Real]Added 94 Read/Feed constraints in 52 ms returned sat
[2024-05-23 05:28:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:28:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:54] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 05:28:54] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:28:54] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-23 05:28:54] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 272 ms.
[2024-05-23 05:28:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:55] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 05:28:55] [INFO ] [Real]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-23 05:28:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:28:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:55] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-23 05:28:55] [INFO ] [Nat]Added 94 Read/Feed constraints in 49 ms returned sat
[2024-05-23 05:28:55] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 72 ms.
[2024-05-23 05:28:55] [INFO ] Added : 1 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 321 ms.
[2024-05-23 05:28:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:56] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 05:28:56] [INFO ] [Real]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-23 05:28:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:28:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:28:56] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 05:28:56] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-23 05:28:56] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 73 ms.
[2024-05-23 05:28:57] [INFO ] Added : 10 causal constraints over 4 iterations in 290 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[294, 149, 185, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[294, 149, 185, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 54 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 53 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-23 05:28:57] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:28:57] [INFO ] Invariant cache hit.
[2024-05-23 05:28:57] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-23 05:28:58] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:28:58] [INFO ] Invariant cache hit.
[2024-05-23 05:28:58] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:28:59] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
[2024-05-23 05:28:59] [INFO ] Redundant transitions in 28 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-23 05:28:59] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:28:59] [INFO ] Invariant cache hit.
[2024-05-23 05:28:59] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-23 05:29:15] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64692ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64706ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66615 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-23 05:30:04] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :[2, 2, 0, 2, 3, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[294, 149, 185, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:30:04] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:30:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[294, 149, 185, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2462 ms. (406 steps per ms)
BEST_FIRST walk for 9000008 steps (18 resets) in 7898 ms. (1139 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[294, 149, 224, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:30:14] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:30:14] [INFO ] Invariant cache hit.
[2024-05-23 05:30:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:30:15] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 05:30:15] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:30:15] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:30:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:30:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:30:15] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 05:30:15] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:30:15] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 74 ms.
[2024-05-23 05:30:15] [INFO ] Added : 3 causal constraints over 1 iterations in 184 ms. Result :sat
Minimization took 311 ms.
[2024-05-23 05:30:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:16] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-23 05:30:16] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:30:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:30:16] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-23 05:30:16] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:30:16] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 72 ms.
[2024-05-23 05:30:16] [INFO ] Added : 6 causal constraints over 3 iterations in 246 ms. Result :sat
Minimization took 306 ms.
[2024-05-23 05:30:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:17] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 05:30:17] [INFO ] [Real]Added 94 Read/Feed constraints in 72 ms returned sat
[2024-05-23 05:30:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:30:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:17] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 05:30:17] [INFO ] [Nat]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-23 05:30:18] [INFO ] Deduced a trap composed of 90 places in 216 ms of which 4 ms to minimize.
[2024-05-23 05:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-05-23 05:30:18] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 69 ms.
[2024-05-23 05:30:18] [INFO ] Added : 12 causal constraints over 4 iterations in 281 ms. Result :sat
Minimization took 317 ms.
[2024-05-23 05:30:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:18] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:30:18] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:30:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:30:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:30:19] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:30:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:30:19] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 74 ms.
[2024-05-23 05:30:19] [INFO ] Added : 7 causal constraints over 2 iterations in 219 ms. Result :sat
Minimization took 269 ms.
[2024-05-23 05:30:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:20] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 05:30:20] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:30:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:30:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:20] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-23 05:30:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 05:30:20] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 69 ms.
[2024-05-23 05:30:20] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 291 ms.
[2024-05-23 05:30:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:30:21] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 05:30:21] [INFO ] [Real]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-23 05:30:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:30:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:21] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-23 05:30:21] [INFO ] [Nat]Added 94 Read/Feed constraints in 64 ms returned sat
[2024-05-23 05:30:21] [INFO ] Deduced a trap composed of 87 places in 209 ms of which 3 ms to minimize.
[2024-05-23 05:30:21] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 3 ms to minimize.
[2024-05-23 05:30:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2024-05-23 05:30:22] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 70 ms.
[2024-05-23 05:30:22] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 334 ms.
[2024-05-23 05:30:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:30:22] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:30:22] [INFO ] [Real]Added 94 Read/Feed constraints in 43 ms returned sat
[2024-05-23 05:30:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:30:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:23] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 05:30:23] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 05:30:23] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 63 ms.
[2024-05-23 05:30:23] [INFO ] Added : 1 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 305 ms.
[2024-05-23 05:30:23] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:23] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-23 05:30:23] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-23 05:30:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:30:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 05:30:24] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-23 05:30:24] [INFO ] [Nat]Added 94 Read/Feed constraints in 50 ms returned sat
[2024-05-23 05:30:24] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 76 ms.
[2024-05-23 05:30:24] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 315 ms.
[2024-05-23 05:30:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:30:25] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-23 05:30:25] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2024-05-23 05:30:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:30:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:30:25] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 05:30:25] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:30:25] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 71 ms.
[2024-05-23 05:30:25] [INFO ] Added : 10 causal constraints over 4 iterations in 271 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[294, 149, 224, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[294, 149, 224, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 52 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 48 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-23 05:30:26] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:30:26] [INFO ] Invariant cache hit.
[2024-05-23 05:30:26] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-23 05:30:26] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:30:26] [INFO ] Invariant cache hit.
[2024-05-23 05:30:26] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:30:28] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
[2024-05-23 05:30:28] [INFO ] Redundant transitions in 24 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-23 05:30:28] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:30:28] [INFO ] Invariant cache hit.
[2024-05-23 05:30:28] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-23 05:30:44] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64798ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64810ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66650 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-23 05:31:32] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :[0, 2, 0, 3, 0, 1, 3, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[294, 149, 224, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:31:33] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:31:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[294, 149, 224, 98, 729, 15, 682, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2407 ms. (415 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 7703 ms. (1168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:31:43] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:31:43] [INFO ] Invariant cache hit.
[2024-05-23 05:31:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:31:43] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 05:31:43] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:31:43] [INFO ] [Real]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 05:31:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:31:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:31:43] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 05:31:43] [INFO ] [Nat]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:31:43] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 77 ms.
[2024-05-23 05:31:44] [INFO ] Added : 3 causal constraints over 1 iterations in 192 ms. Result :sat
Minimization took 270 ms.
[2024-05-23 05:31:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:31:44] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-23 05:31:44] [INFO ] [Real]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:31:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:31:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:31:44] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-23 05:31:45] [INFO ] [Nat]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:31:45] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 71 ms.
[2024-05-23 05:31:45] [INFO ] Added : 6 causal constraints over 3 iterations in 247 ms. Result :sat
Minimization took 314 ms.
[2024-05-23 05:31:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:31:45] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-23 05:31:45] [INFO ] [Real]Added 94 Read/Feed constraints in 71 ms returned sat
[2024-05-23 05:31:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:31:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:31:46] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 05:31:46] [INFO ] [Nat]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-23 05:31:46] [INFO ] Deduced a trap composed of 90 places in 216 ms of which 4 ms to minimize.
[2024-05-23 05:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-05-23 05:31:46] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-23 05:31:46] [INFO ] Added : 12 causal constraints over 4 iterations in 267 ms. Result :sat
Minimization took 280 ms.
[2024-05-23 05:31:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:31:47] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 05:31:47] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:31:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:31:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:31:47] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-23 05:31:47] [INFO ] [Nat]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:31:47] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 70 ms.
[2024-05-23 05:31:47] [INFO ] Added : 7 causal constraints over 2 iterations in 223 ms. Result :sat
Minimization took 326 ms.
[2024-05-23 05:31:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:31:48] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 05:31:48] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:31:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:31:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:31:48] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-23 05:31:48] [INFO ] [Nat]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:31:48] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 73 ms.
[2024-05-23 05:31:49] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 322 ms.
[2024-05-23 05:31:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:31:49] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 05:31:49] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2024-05-23 05:31:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:31:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:31:49] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-23 05:31:50] [INFO ] [Nat]Added 94 Read/Feed constraints in 65 ms returned sat
[2024-05-23 05:31:50] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 3 ms to minimize.
[2024-05-23 05:31:50] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 3 ms to minimize.
[2024-05-23 05:31:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2024-05-23 05:31:50] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 74 ms.
[2024-05-23 05:31:50] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 340 ms.
[2024-05-23 05:31:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:31:51] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 05:31:51] [INFO ] [Real]Added 94 Read/Feed constraints in 42 ms returned sat
[2024-05-23 05:31:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:31:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:31:51] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:31:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 05:31:51] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 75 ms.
[2024-05-23 05:31:51] [INFO ] Added : 1 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 302 ms.
[2024-05-23 05:31:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:31:52] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 05:31:52] [INFO ] [Real]Added 94 Read/Feed constraints in 46 ms returned sat
[2024-05-23 05:31:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:31:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:31:52] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-23 05:31:52] [INFO ] [Nat]Added 94 Read/Feed constraints in 49 ms returned sat
[2024-05-23 05:31:52] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 79 ms.
[2024-05-23 05:31:52] [INFO ] Added : 1 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 290 ms.
[2024-05-23 05:31:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:31:53] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 05:31:53] [INFO ] [Real]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:31:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:31:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:31:53] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 05:31:53] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-23 05:31:53] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 63 ms.
[2024-05-23 05:31:54] [INFO ] Added : 10 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 321 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 51 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 49 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-23 05:31:54] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:31:54] [INFO ] Invariant cache hit.
[2024-05-23 05:31:55] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-23 05:31:55] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:31:55] [INFO ] Invariant cache hit.
[2024-05-23 05:31:55] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:31:56] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
[2024-05-23 05:31:56] [INFO ] Redundant transitions in 24 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-23 05:31:56] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:31:56] [INFO ] Invariant cache hit.
[2024-05-23 05:31:56] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-23 05:32:12] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64531ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66321 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-23 05:33:00] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :[0, 2, 0, 4, 0, 0, 0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:33:01] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:33:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 1000001 steps (2 resets) in 2538 ms. (393 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 7803 ms. (1153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
[2024-05-23 05:33:11] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:33:11] [INFO ] Invariant cache hit.
[2024-05-23 05:33:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:11] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 05:33:11] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:33:11] [INFO ] [Real]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:33:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:33:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:33:12] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 05:33:12] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:33:12] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 69 ms.
[2024-05-23 05:33:12] [INFO ] Added : 3 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 278 ms.
[2024-05-23 05:33:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:33:12] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-23 05:33:13] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:33:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:33:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:13] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-23 05:33:13] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:33:13] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 65 ms.
[2024-05-23 05:33:13] [INFO ] Added : 6 causal constraints over 3 iterations in 225 ms. Result :sat
Minimization took 277 ms.
[2024-05-23 05:33:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:33:14] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 05:33:14] [INFO ] [Real]Added 94 Read/Feed constraints in 72 ms returned sat
[2024-05-23 05:33:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:33:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:14] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 05:33:14] [INFO ] [Nat]Added 94 Read/Feed constraints in 48 ms returned sat
[2024-05-23 05:33:14] [INFO ] Deduced a trap composed of 90 places in 233 ms of which 3 ms to minimize.
[2024-05-23 05:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2024-05-23 05:33:14] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 70 ms.
[2024-05-23 05:33:15] [INFO ] Added : 12 causal constraints over 4 iterations in 270 ms. Result :sat
Minimization took 331 ms.
[2024-05-23 05:33:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:15] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 05:33:15] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2024-05-23 05:33:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:33:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:15] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-23 05:33:16] [INFO ] [Nat]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:33:16] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 70 ms.
[2024-05-23 05:33:16] [INFO ] Added : 7 causal constraints over 2 iterations in 225 ms. Result :sat
Minimization took 320 ms.
[2024-05-23 05:33:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:33:16] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-23 05:33:16] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:33:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:33:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:33:17] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-23 05:33:17] [INFO ] [Nat]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:33:17] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 109 ms.
[2024-05-23 05:33:17] [INFO ] Added : 1 causal constraints over 1 iterations in 207 ms. Result :sat
Minimization took 320 ms.
[2024-05-23 05:33:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:18] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-23 05:33:18] [INFO ] [Real]Added 94 Read/Feed constraints in 47 ms returned sat
[2024-05-23 05:33:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:33:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:33:18] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-05-23 05:33:18] [INFO ] [Nat]Added 94 Read/Feed constraints in 64 ms returned sat
[2024-05-23 05:33:18] [INFO ] Deduced a trap composed of 87 places in 221 ms of which 4 ms to minimize.
[2024-05-23 05:33:18] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 3 ms to minimize.
[2024-05-23 05:33:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 483 ms
[2024-05-23 05:33:19] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 73 ms.
[2024-05-23 05:33:19] [INFO ] Added : 2 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 322 ms.
[2024-05-23 05:33:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:33:19] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 05:33:19] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2024-05-23 05:33:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:33:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:20] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 05:33:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:33:20] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 69 ms.
[2024-05-23 05:33:20] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 275 ms.
[2024-05-23 05:33:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:20] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 05:33:20] [INFO ] [Real]Added 94 Read/Feed constraints in 47 ms returned sat
[2024-05-23 05:33:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:33:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:21] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-23 05:33:21] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2024-05-23 05:33:21] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 69 ms.
[2024-05-23 05:33:21] [INFO ] Added : 1 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 323 ms.
[2024-05-23 05:33:21] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:33:21] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 05:33:22] [INFO ] [Real]Added 94 Read/Feed constraints in 40 ms returned sat
[2024-05-23 05:33:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:33:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:33:22] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-23 05:33:22] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-23 05:33:22] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-23 05:33:22] [INFO ] Added : 10 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 284 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 48 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 55 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-23 05:33:23] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:33:23] [INFO ] Invariant cache hit.
[2024-05-23 05:33:23] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-23 05:33:23] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:33:23] [INFO ] Invariant cache hit.
[2024-05-23 05:33:23] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:33:24] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1744 ms to find 0 implicit places.
[2024-05-23 05:33:24] [INFO ] Redundant transitions in 21 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-23 05:33:24] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:33:24] [INFO ] Invariant cache hit.
[2024-05-23 05:33:24] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-23 05:33:41] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 65022ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 65037ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66870 ms. Remains : 462/462 places, 1313/1313 transitions.
[2024-05-23 05:34:29] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {199=1, 327=1, 530=1, 746=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 380=1, 583=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :[0, 3, 0, 2, 4, 0, 0, 1, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
RANDOM walk for 40003 steps (8 resets) in 1117 ms. (35 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 191524 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 10
Probabilistic random walk after 191524 steps, saw 118524 distinct states, run finished after 3006 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-23 05:34:33] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:34:34] [INFO ] Invariant cache hit.
[2024-05-23 05:34:34] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 663/1055 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1055 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 82/1137 variables, 19/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 80/499 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 13/1150 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1150 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1150 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 57/1207 variables, 39/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1207 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1207 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 13/1220 variables, 11/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1220 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/1220 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 559 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1262 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 663/1055 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1055 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 82/1137 variables, 19/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 80/499 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 05:34:35] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1137 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1137 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 13/1150 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1150 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1150 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 57/1207 variables, 39/551 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1207 variables, 8/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1207 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 13/1220 variables, 11/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1220 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/1220 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 570 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 3410ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 30006 ms.
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 53 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 462/462 places, 1313/1313 transitions.
RANDOM walk for 40007 steps (8 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 185643 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 10
Probabilistic random walk after 185643 steps, saw 114886 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-23 05:35:10] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:35:10] [INFO ] Invariant cache hit.
[2024-05-23 05:35:10] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 663/1055 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1055 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 82/1137 variables, 19/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 80/499 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 13/1150 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1150 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1150 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 57/1207 variables, 39/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1207 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1207 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 13/1220 variables, 11/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1220 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/1220 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 559 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 663/1055 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1055 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 82/1137 variables, 19/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 80/499 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 05:35:12] [INFO ] Deduced a trap composed of 135 places in 168 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1137 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1137 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 13/1150 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1150 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1150 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 57/1207 variables, 39/551 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1207 variables, 8/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1207 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 13/1220 variables, 11/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1220 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/1220 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 570 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 3398ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 51 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 462/462 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Applied a total of 0 rules in 50 ms. Remains 462 /462 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-23 05:35:44] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:35:44] [INFO ] Invariant cache hit.
[2024-05-23 05:35:44] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-23 05:35:44] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:35:44] [INFO ] Invariant cache hit.
[2024-05-23 05:35:44] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:35:46] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
[2024-05-23 05:35:46] [INFO ] Redundant transitions in 23 ms returned []
Running 1311 sub problems to find dead transitions.
[2024-05-23 05:35:46] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:35:46] [INFO ] Invariant cache hit.
[2024-05-23 05:35:46] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
[2024-05-23 05:36:02] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1220 variables, and 4 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/462 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (OVERLAPS) 758/1220 variables, 462/466 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 94/560 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 1311/1871 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 462/462 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 1/1 constraints]
After SMT, in 64755ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 64769ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66621 ms. Remains : 462/462 places, 1313/1313 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[294, 149, 224, 98, 729, 15, 833, 15, 164] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 16, +inf]
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:36:50] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:36:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-23 05:36:50] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:36:50] [INFO ] Invariant cache hit.
[2024-05-23 05:36:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:36:51] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 05:36:51] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:36:51] [INFO ] [Real]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:36:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:36:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 05:36:51] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 05:36:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:36:51] [INFO ] Deduced a trap composed of 120 places in 218 ms of which 3 ms to minimize.
[2024-05-23 05:36:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2024-05-23 05:36:51] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 73 ms.
[2024-05-23 05:36:51] [INFO ] Added : 11 causal constraints over 4 iterations in 267 ms. Result :sat
Minimization took 291 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 448 transition count 1280
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 448 transition count 1280
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 448 transition count 1276
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 444 transition count 1268
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 444 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 48 place count 440 transition count 1258
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 440 transition count 1258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 436 transition count 1248
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 436 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 432 transition count 1240
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 429 transition count 1234
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 426 transition count 1228
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 424 transition count 1224
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 422 transition count 1220
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 421 transition count 1218
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 421 transition count 1218
Applied a total of 90 rules in 158 ms. Remains 421 /462 variables (removed 41) and now considering 1218/1313 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 421/462 places, 1218/1313 transitions.
[2024-05-23 05:36:52] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-23 05:36:52] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-23 05:36:52] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2263 ms. (441 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 745 ms. (1340 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[490] Max Struct:[+inf]
[2024-05-23 05:36:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:36:55] [INFO ] Invariant cache hit.
[2024-05-23 05:36:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:36:55] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 05:36:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:36:56] [INFO ] [Real]Added 75 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:36:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:36:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:36:56] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 05:36:56] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 05:36:56] [INFO ] Deduced a trap composed of 113 places in 205 ms of which 3 ms to minimize.
[2024-05-23 05:36:56] [INFO ] Deduced a trap composed of 109 places in 203 ms of which 3 ms to minimize.
[2024-05-23 05:36:56] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 3 ms to minimize.
[2024-05-23 05:36:57] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 6 ms to minimize.
[2024-05-23 05:36:57] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 3 ms to minimize.
[2024-05-23 05:36:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1154 ms
[2024-05-23 05:36:57] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 67 ms.
[2024-05-23 05:36:57] [INFO ] Added : 10 causal constraints over 3 iterations in 233 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[490] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[490] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 49 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 05:36:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:36:58] [INFO ] Invariant cache hit.
[2024-05-23 05:36:58] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-23 05:36:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:36:58] [INFO ] Invariant cache hit.
[2024-05-23 05:36:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:36:59] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
[2024-05-23 05:36:59] [INFO ] Redundant transitions in 23 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 05:36:59] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:36:59] [INFO ] Invariant cache hit.
[2024-05-23 05:36:59] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 05:37:13] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:37:14] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34179ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34191ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35907 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 05:37:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[490] Max Struct:[+inf]
[2024-05-23 05:37:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:37:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[490] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2213 ms. (451 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 748 ms. (1335 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[490] Max Struct:[+inf]
[2024-05-23 05:37:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:37:37] [INFO ] Invariant cache hit.
[2024-05-23 05:37:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:37:37] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-23 05:37:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:37:37] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:37:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:37:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:37:37] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 05:37:37] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 05:37:37] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 3 ms to minimize.
[2024-05-23 05:37:38] [INFO ] Deduced a trap composed of 109 places in 193 ms of which 2 ms to minimize.
[2024-05-23 05:37:38] [INFO ] Deduced a trap composed of 87 places in 188 ms of which 3 ms to minimize.
[2024-05-23 05:37:38] [INFO ] Deduced a trap composed of 74 places in 185 ms of which 3 ms to minimize.
[2024-05-23 05:37:38] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 2 ms to minimize.
[2024-05-23 05:37:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1066 ms
[2024-05-23 05:37:38] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 63 ms.
[2024-05-23 05:37:39] [INFO ] Added : 10 causal constraints over 3 iterations in 227 ms. Result :sat
Minimization took 287 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[490] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[490] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 05:37:39] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:37:39] [INFO ] Invariant cache hit.
[2024-05-23 05:37:39] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-23 05:37:39] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:37:39] [INFO ] Invariant cache hit.
[2024-05-23 05:37:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:37:41] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
[2024-05-23 05:37:41] [INFO ] Redundant transitions in 18 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 05:37:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:37:41] [INFO ] Invariant cache hit.
[2024-05-23 05:37:41] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 05:37:55] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 2 ms to minimize.
[2024-05-23 05:37:55] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34081ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35816 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 05:38:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[490] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 528521 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 528521 steps, saw 324082 distinct states, run finished after 3002 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-23 05:38:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:38:18] [INFO ] Invariant cache hit.
[2024-05-23 05:38:18] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 632ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2702 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 47 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527902 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527902 steps, saw 323704 distinct states, run finished after 3002 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-23 05:38:24] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:38:24] [INFO ] Invariant cache hit.
[2024-05-23 05:38:24] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 610ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2695 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 47 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 48 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 05:38:28] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:38:28] [INFO ] Invariant cache hit.
[2024-05-23 05:38:28] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 05:38:28] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:38:28] [INFO ] Invariant cache hit.
[2024-05-23 05:38:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:38:29] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2024-05-23 05:38:30] [INFO ] Redundant transitions in 16 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 05:38:30] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:38:30] [INFO ] Invariant cache hit.
[2024-05-23 05:38:30] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 05:38:44] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:38:44] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34248ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35936 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 59 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 05:39:04] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 05:39:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 05:39:04] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:39:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:39:04] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:39:04] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:39:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 05:39:04] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:39:04] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 05:39:04] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:39:04] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 138 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[490] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-02 in 133570 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:39:04] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-23 05:39:04] [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 26 ms. (370 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 05:39:04] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:39:04] [INFO ] Invariant cache hit.
[2024-05-23 05:39:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:39:04] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 05:39:04] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:39:04] [INFO ] [Real]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:39:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:39:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:39:04] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 05:39:05] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:39:05] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 74 ms.
[2024-05-23 05:39:05] [INFO ] Added : 5 causal constraints over 3 iterations in 250 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 453 transition count 1294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 448 transition count 1280
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 448 transition count 1280
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 448 transition count 1276
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 38 place count 444 transition count 1268
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 444 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 46 place count 440 transition count 1260
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 440 transition count 1260
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 54 place count 436 transition count 1250
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 436 transition count 1250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 62 place count 432 transition count 1242
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 432 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 429 transition count 1236
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 429 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 426 transition count 1230
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 426 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 425 transition count 1228
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 425 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 424 transition count 1226
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 423 transition count 1224
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 423 transition count 1224
Applied a total of 84 rules in 216 ms. Remains 423 /462 variables (removed 39) and now considering 1224/1313 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 423/462 places, 1224/1313 transitions.
[2024-05-23 05:39:05] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-23 05:39:06] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2024-05-23 05:39:06] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2230 ms. (448 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 756 ms. (1321 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[217] Max Struct:[+inf]
[2024-05-23 05:39:09] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:39:09] [INFO ] Invariant cache hit.
[2024-05-23 05:39:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:39:09] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 05:39:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:39:09] [INFO ] [Real]Added 75 Read/Feed constraints in 30 ms returned sat
[2024-05-23 05:39:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:39:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:39:09] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 05:39:09] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 05:39:09] [INFO ] Deduced a trap composed of 113 places in 213 ms of which 3 ms to minimize.
[2024-05-23 05:39:10] [INFO ] Deduced a trap composed of 90 places in 198 ms of which 2 ms to minimize.
[2024-05-23 05:39:10] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 3 ms to minimize.
[2024-05-23 05:39:10] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 3 ms to minimize.
[2024-05-23 05:39:10] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 3 ms to minimize.
[2024-05-23 05:39:10] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 2 ms to minimize.
[2024-05-23 05:39:11] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 2 ms to minimize.
[2024-05-23 05:39:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1488 ms
[2024-05-23 05:39:11] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 66 ms.
[2024-05-23 05:39:11] [INFO ] Added : 22 causal constraints over 5 iterations in 312 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[217] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[217] 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 48 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 49 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 46 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 05:39:12] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:39:12] [INFO ] Invariant cache hit.
[2024-05-23 05:39:13] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-23 05:39:13] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:39:13] [INFO ] Invariant cache hit.
[2024-05-23 05:39:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:39:14] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2024-05-23 05:39:14] [INFO ] Redundant transitions in 20 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 05:39:14] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:39:14] [INFO ] Invariant cache hit.
[2024-05-23 05:39:14] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 05:39:28] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 3 ms to minimize.
[2024-05-23 05:39:29] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/428 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34128ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35832 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 05:39:48] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[217] Max Struct:[+inf]
[2024-05-23 05:39:49] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:39:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[217] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2224 ms. (449 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 759 ms. (1315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[217] Max Struct:[+inf]
[2024-05-23 05:39:52] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:39:52] [INFO ] Invariant cache hit.
[2024-05-23 05:39:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:39:52] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 05:39:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:39:52] [INFO ] [Real]Added 75 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:39:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:39:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:39:52] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 05:39:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 29 ms returned sat
[2024-05-23 05:39:52] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 3 ms to minimize.
[2024-05-23 05:39:53] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 3 ms to minimize.
[2024-05-23 05:39:53] [INFO ] Deduced a trap composed of 78 places in 193 ms of which 3 ms to minimize.
[2024-05-23 05:39:53] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 3 ms to minimize.
[2024-05-23 05:39:53] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 3 ms to minimize.
[2024-05-23 05:39:53] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 4 ms to minimize.
[2024-05-23 05:39:54] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 3 ms to minimize.
[2024-05-23 05:39:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1512 ms
[2024-05-23 05:39:54] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 68 ms.
[2024-05-23 05:39:54] [INFO ] Added : 22 causal constraints over 5 iterations in 292 ms. Result :sat
Minimization took 288 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[217] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[217] 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 60 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 60 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 05:39:55] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:39:55] [INFO ] Invariant cache hit.
[2024-05-23 05:39:56] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 05:39:56] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:39:56] [INFO ] Invariant cache hit.
[2024-05-23 05:39:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:39:57] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
[2024-05-23 05:39:57] [INFO ] Redundant transitions in 21 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 05:39:57] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:39:57] [INFO ] Invariant cache hit.
[2024-05-23 05:39:57] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 05:40:11] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 2 ms to minimize.
[2024-05-23 05:40:12] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/428 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34240ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35937 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 05:40:31] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[217] Max Struct:[+inf]
RANDOM walk for 40006 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 524213 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 524213 steps, saw 321442 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 05:40:35] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:40:35] [INFO ] Invariant cache hit.
[2024-05-23 05:40:35] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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 312 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 354 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 676ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1322 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 57 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 57 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 559013 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 559013 steps, saw 342779 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-23 05:40:40] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:40:40] [INFO ] Invariant cache hit.
[2024-05-23 05:40:40] [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 317 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 329 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 656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1365 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 48 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 49 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 45 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 05:40:42] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:40:42] [INFO ] Invariant cache hit.
[2024-05-23 05:40:42] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-23 05:40:42] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:40:42] [INFO ] Invariant cache hit.
[2024-05-23 05:40:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:40:44] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
[2024-05-23 05:40:44] [INFO ] Redundant transitions in 15 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 05:40:44] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 05:40:44] [INFO ] Invariant cache hit.
[2024-05-23 05:40:44] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 05:40:58] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 2 ms to minimize.
[2024-05-23 05:40:59] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34341ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34353ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36026 ms. Remains : 423/423 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 423 transition count 681
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 553 place count 413 transition count 681
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 413 transition count 608
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 699 place count 340 transition count 608
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 955 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1403 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1405 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 19 transition count 31
Applied a total of 1408 rules in 66 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 05:41:18] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 05:41:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 05:41:18] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:41:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:41:18] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:41:18] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:41:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 05:41:18] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:41:18] [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 05:41:18] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:41:18] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 137 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[217] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-05 in 134177 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:41:18] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-23 05:41:18] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:41:18] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:41:18] [INFO ] Invariant cache hit.
[2024-05-23 05:41:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:41:18] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:41:18] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:41:18] [INFO ] [Real]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:41:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:41:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:41:19] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 05:41:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2024-05-23 05:41:19] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-23 05:41:19] [INFO ] Added : 3 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 290 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 448 transition count 1278
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 448 transition count 1278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 448 transition count 1274
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 444 transition count 1266
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 444 transition count 1266
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 48 place count 440 transition count 1256
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 440 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 436 transition count 1246
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 436 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 432 transition count 1238
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 432 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 428 transition count 1230
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 428 transition count 1230
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 424 transition count 1222
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 424 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 422 transition count 1218
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 422 transition count 1218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 420 transition count 1214
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 419 transition count 1212
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 419 transition count 1212
Applied a total of 94 rules in 187 ms. Remains 419 /462 variables (removed 43) and now considering 1212/1313 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 419/462 places, 1212/1313 transitions.
[2024-05-23 05:41:19] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:41:20] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-23 05:41:20] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2343 ms. (426 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 779 ms. (1282 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[576] Max Struct:[+inf]
[2024-05-23 05:41:23] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:41:23] [INFO ] Invariant cache hit.
[2024-05-23 05:41:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:41:23] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-23 05:41:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:41:23] [INFO ] [Real]Added 75 Read/Feed constraints in 35 ms returned sat
[2024-05-23 05:41:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:41:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:41:23] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 05:41:23] [INFO ] [Nat]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-23 05:41:24] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 3 ms to minimize.
[2024-05-23 05:41:24] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 3 ms to minimize.
[2024-05-23 05:41:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2024-05-23 05:41:24] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 92 ms.
[2024-05-23 05:41:24] [INFO ] Added : 17 causal constraints over 5 iterations in 345 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[576] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[576] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 57 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 43 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 05:41:27] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:41:27] [INFO ] Invariant cache hit.
[2024-05-23 05:41:28] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-23 05:41:28] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:41:28] [INFO ] Invariant cache hit.
[2024-05-23 05:41:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:41:29] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
[2024-05-23 05:41:29] [INFO ] Redundant transitions in 21 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 05:41:29] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:41:29] [INFO ] Invariant cache hit.
[2024-05-23 05:41:29] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 05:41:43] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:41:44] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/424 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34688ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34700ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36365 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 05:42:04] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[576] Max Struct:[+inf]
[2024-05-23 05:42:04] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:42:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[576] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2242 ms. (445 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 756 ms. (1321 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[576] Max Struct:[+inf]
[2024-05-23 05:42:07] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:42:07] [INFO ] Invariant cache hit.
[2024-05-23 05:42:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:42:07] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 05:42:07] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:42:07] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-23 05:42:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:42:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:42:08] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 05:42:08] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 05:42:08] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 2 ms to minimize.
[2024-05-23 05:42:08] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 3 ms to minimize.
[2024-05-23 05:42:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2024-05-23 05:42:08] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 77 ms.
[2024-05-23 05:42:08] [INFO ] Added : 17 causal constraints over 5 iterations in 333 ms. Result :sat
Minimization took 303 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[576] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[576] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 51 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 05:42:12] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:42:12] [INFO ] Invariant cache hit.
[2024-05-23 05:42:12] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-23 05:42:12] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:42:12] [INFO ] Invariant cache hit.
[2024-05-23 05:42:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:42:13] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2024-05-23 05:42:13] [INFO ] Redundant transitions in 20 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 05:42:13] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:42:13] [INFO ] Invariant cache hit.
[2024-05-23 05:42:13] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 05:42:27] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 2 ms to minimize.
[2024-05-23 05:42:28] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/424 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34472ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34482ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36147 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 05:42:48] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[576] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 535974 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 535974 steps, saw 328653 distinct states, run finished after 3002 ms. (steps per millisecond=178 ) properties seen :0
[2024-05-23 05:42:51] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:42:51] [INFO ] Invariant cache hit.
[2024-05-23 05:42:51] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 615ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2346 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 419/419 places, 1212/1212 transitions.
RANDOM walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540695 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 540695 steps, saw 331547 distinct states, run finished after 3002 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-23 05:42:57] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:42:57] [INFO ] Invariant cache hit.
[2024-05-23 05:42: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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2297 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 45 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 43 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 05:43:00] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:43:00] [INFO ] Invariant cache hit.
[2024-05-23 05:43:00] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-23 05:43:00] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:43:00] [INFO ] Invariant cache hit.
[2024-05-23 05:43:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:43:02] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
[2024-05-23 05:43:02] [INFO ] Redundant transitions in 20 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 05:43:02] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 05:43:02] [INFO ] Invariant cache hit.
[2024-05-23 05:43:02] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 05:43:17] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:43:17] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/424 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34610ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34622ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36266 ms. Remains : 419/419 places, 1212/1212 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 419 transition count 673
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 551 place count 407 transition count 673
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 551 place count 407 transition count 604
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 689 place count 338 transition count 604
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 945 place count 210 transition count 476
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1009 place count 146 transition count 348
Iterating global reduction 2 with 64 rules applied. Total rules applied 1073 place count 146 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1074 place count 146 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1074 place count 146 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1076 place count 145 transition count 346
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1139 place count 82 transition count 220
Iterating global reduction 3 with 63 rules applied. Total rules applied 1202 place count 82 transition count 220
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1265 place count 19 transition count 94
Iterating global reduction 3 with 63 rules applied. Total rules applied 1328 place count 19 transition count 94
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1391 place count 19 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1391 place count 19 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1393 place count 18 transition count 30
Applied a total of 1393 rules in 24 ms. Remains 18 /419 variables (removed 401) and now considering 30/1212 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2024-05-23 05:43:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 05:43:36] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 05:43:36] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:43:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 05:43:36] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:43:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:43:36] [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 05:43:36] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:43:36] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 97 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[576] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-08 in 138330 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:43:36] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-23 05:43:36] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[+inf]
[2024-05-23 05:43:36] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:43:36] [INFO ] Invariant cache hit.
[2024-05-23 05:43:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:43:37] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 05:43:37] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:43:37] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:43:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:43:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:43:37] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-23 05:43:37] [INFO ] [Nat]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 05:43:37] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 73 ms.
[2024-05-23 05:43:37] [INFO ] Added : 8 causal constraints over 3 iterations in 258 ms. Result :sat
Minimization took 306 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 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 453 transition count 1294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 449 transition count 1282
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 449 transition count 1282
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 445 transition count 1274
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 445 transition count 1274
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 441 transition count 1264
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 441 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 437 transition count 1256
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 437 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 433 transition count 1248
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 433 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 430 transition count 1242
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 430 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 427 transition count 1236
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 427 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 426 transition count 1234
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 426 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 425 transition count 1232
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 425 transition count 1232
Applied a total of 76 rules in 140 ms. Remains 425 /462 variables (removed 37) and now considering 1232/1313 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 425/462 places, 1232/1313 transitions.
[2024-05-23 05:43:38] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
[2024-05-23 05:43:38] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2024-05-23 05:43:38] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 2387 ms. (418 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 873 ms. (1144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[130] Max Struct:[+inf]
[2024-05-23 05:43:41] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:43:41] [INFO ] Invariant cache hit.
[2024-05-23 05:43:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:43:42] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-23 05:43:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:43:42] [INFO ] [Real]Added 75 Read/Feed constraints in 44 ms returned sat
[2024-05-23 05:43:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:43:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:43:42] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-23 05:43:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:43:42] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 3 ms to minimize.
[2024-05-23 05:43:42] [INFO ] Deduced a trap composed of 97 places in 206 ms of which 3 ms to minimize.
[2024-05-23 05:43:43] [INFO ] Deduced a trap composed of 81 places in 195 ms of which 2 ms to minimize.
[2024-05-23 05:43:43] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 3 ms to minimize.
[2024-05-23 05:43:43] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 3 ms to minimize.
[2024-05-23 05:43:43] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 2 ms to minimize.
[2024-05-23 05:43:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1352 ms
[2024-05-23 05:43:43] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 73 ms.
[2024-05-23 05:43:44] [INFO ] Added : 23 causal constraints over 5 iterations in 299 ms. Result :sat
Minimization took 298 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[130] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[130] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 44 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 05:43:45] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:43:45] [INFO ] Invariant cache hit.
[2024-05-23 05:43:45] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-23 05:43:45] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:43:45] [INFO ] Invariant cache hit.
[2024-05-23 05:43:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:43:46] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
[2024-05-23 05:43:46] [INFO ] Redundant transitions in 15 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 05:43:46] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:43:46] [INFO ] Invariant cache hit.
[2024-05-23 05:43:46] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 05:44:01] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 2 ms to minimize.
[2024-05-23 05:44:04] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/430 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34322ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34332ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36005 ms. Remains : 425/425 places, 1232/1232 transitions.
[2024-05-23 05:44:21] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[130] Max Struct:[+inf]
[2024-05-23 05:44:21] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:44:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[130] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2238 ms. (446 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 825 ms. (1210 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[130] Max Struct:[+inf]
[2024-05-23 05:44:24] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:44:24] [INFO ] Invariant cache hit.
[2024-05-23 05:44:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:44:24] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 05:44:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:44:24] [INFO ] [Real]Added 75 Read/Feed constraints in 45 ms returned sat
[2024-05-23 05:44:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:44:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:44:25] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 05:44:25] [INFO ] [Nat]Added 75 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:44:25] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 3 ms to minimize.
[2024-05-23 05:44:25] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 2 ms to minimize.
[2024-05-23 05:44:25] [INFO ] Deduced a trap composed of 81 places in 201 ms of which 3 ms to minimize.
[2024-05-23 05:44:25] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 3 ms to minimize.
[2024-05-23 05:44:26] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 3 ms to minimize.
[2024-05-23 05:44:26] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 3 ms to minimize.
[2024-05-23 05:44:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1317 ms
[2024-05-23 05:44:26] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 71 ms.
[2024-05-23 05:44:26] [INFO ] Added : 23 causal constraints over 5 iterations in 290 ms. Result :sat
Minimization took 292 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[130] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[130] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 49 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 05:44:27] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:44:27] [INFO ] Invariant cache hit.
[2024-05-23 05:44:28] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-23 05:44:28] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:44:28] [INFO ] Invariant cache hit.
[2024-05-23 05:44:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:44:29] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2024-05-23 05:44:29] [INFO ] Redundant transitions in 18 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 05:44:29] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:44:29] [INFO ] Invariant cache hit.
[2024-05-23 05:44:29] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 05:44:44] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 2 ms to minimize.
[2024-05-23 05:44:48] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/430 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34537ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34548ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36246 ms. Remains : 425/425 places, 1232/1232 transitions.
[2024-05-23 05:45:04] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[130] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 528721 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 528721 steps, saw 327148 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-23 05:45:07] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:45:07] [INFO ] Invariant cache hit.
[2024-05-23 05:45:07] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 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 733ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 848 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 425/425 places, 1232/1232 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 531303 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 531303 steps, saw 328746 distinct states, run finished after 3002 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-23 05:45:12] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:45:12] [INFO ] Invariant cache hit.
[2024-05-23 05:45:12] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 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 736ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 827 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 44 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 48 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 05:45:13] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:45:13] [INFO ] Invariant cache hit.
[2024-05-23 05:45:14] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-23 05:45:14] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:45:14] [INFO ] Invariant cache hit.
[2024-05-23 05:45:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:45:15] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
[2024-05-23 05:45:15] [INFO ] Redundant transitions in 21 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 05:45:15] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 05:45:15] [INFO ] Invariant cache hit.
[2024-05-23 05:45:15] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 05:45:30] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 2 ms to minimize.
[2024-05-23 05:45:33] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/430 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34633ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34645ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36334 ms. Remains : 425/425 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 425 transition count 686
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 555 place count 416 transition count 686
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 555 place count 416 transition count 613
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 701 place count 343 transition count 613
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 961 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 149 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 149 transition count 353
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 86 transition count 227
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 86 transition count 227
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 23 transition count 101
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 23 transition count 101
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 23 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 23 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1408 place count 22 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 21 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1415 place count 20 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1416 place count 19 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 1417 place count 19 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1419 place count 19 transition count 31
Applied a total of 1419 rules in 30 ms. Remains 19 /425 variables (removed 406) and now considering 31/1232 (removed 1201) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 05:45:50] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 05:45:50] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 05:45:50] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:45:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:45:50] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:45:50] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:45:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 05:45:50] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:45:50] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 05:45:50] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:45:50] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 96 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[130] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-09 in 133195 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:45:50] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-23 05:45:50] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 28 ms. (344 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 05:45:50] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:45:50] [INFO ] Invariant cache hit.
[2024-05-23 05:45:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:45:50] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 05:45:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:45:50] [INFO ] [Real]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:45:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:45:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:45:50] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-23 05:45:50] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-23 05:45:50] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 64 ms.
[2024-05-23 05:45:50] [INFO ] Added : 1 causal constraints over 1 iterations in 146 ms. Result :sat
Minimization took 291 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 447 transition count 1276
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 447 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 447 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 442 transition count 1262
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 442 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 437 transition count 1250
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 432 transition count 1238
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 432 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 73 place count 427 transition count 1228
Iterating global reduction 3 with 5 rules applied. Total rules applied 78 place count 427 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 423 transition count 1220
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 423 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 419 transition count 1212
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 417 transition count 1208
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 417 transition count 1208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 415 transition count 1204
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 414 transition count 1202
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 414 transition count 1202
Applied a total of 104 rules in 137 ms. Remains 414 /462 variables (removed 48) and now considering 1202/1313 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 414/462 places, 1202/1313 transitions.
[2024-05-23 05:45:51] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-23 05:45:51] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2024-05-23 05:45:51] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000005 steps (2 resets) in 2175 ms. (459 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 760 ms. (1314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1683] Max Struct:[+inf]
[2024-05-23 05:45:54] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:45:54] [INFO ] Invariant cache hit.
[2024-05-23 05:45:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:45:54] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 05:45:54] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:45:54] [INFO ] [Real]Added 74 Read/Feed constraints in 28 ms returned sat
[2024-05-23 05:45:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:45:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:45:55] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 05:45:55] [INFO ] [Nat]Added 74 Read/Feed constraints in 30 ms returned sat
[2024-05-23 05:45:55] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 3 ms to minimize.
[2024-05-23 05:45:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-23 05:45:55] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 71 ms.
[2024-05-23 05:45:55] [INFO ] Added : 7 causal constraints over 4 iterations in 277 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1683] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1683] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 48 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 44 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-23 05:45:59] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:45:59] [INFO ] Invariant cache hit.
[2024-05-23 05:46:00] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 05:46:00] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:46:00] [INFO ] Invariant cache hit.
[2024-05-23 05:46:00] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:46:01] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
[2024-05-23 05:46:01] [INFO ] Redundant transitions in 19 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 05:46:01] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:46:01] [INFO ] Invariant cache hit.
[2024-05-23 05:46:01] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-23 05:46:15] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 3 ms to minimize.
[2024-05-23 05:46:16] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 34302ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 34312ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36074 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-23 05:46:35] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[1683] Max Struct:[+inf]
[2024-05-23 05:46:36] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:46:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1683] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2222 ms. (449 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 715 ms. (1396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1683] Max Struct:[+inf]
[2024-05-23 05:46:38] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:46:38] [INFO ] Invariant cache hit.
[2024-05-23 05:46:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:46:39] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 05:46:39] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:46:39] [INFO ] [Real]Added 74 Read/Feed constraints in 32 ms returned sat
[2024-05-23 05:46:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:46:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:46:39] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-23 05:46:39] [INFO ] [Nat]Added 74 Read/Feed constraints in 28 ms returned sat
[2024-05-23 05:46:39] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 3 ms to minimize.
[2024-05-23 05:46:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-23 05:46:39] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 62 ms.
[2024-05-23 05:46:40] [INFO ] Added : 7 causal constraints over 4 iterations in 278 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1683] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1683] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 46 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 44 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-23 05:46:43] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:46:43] [INFO ] Invariant cache hit.
[2024-05-23 05:46:44] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-23 05:46:44] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:46:44] [INFO ] Invariant cache hit.
[2024-05-23 05:46:44] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:46:45] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
[2024-05-23 05:46:45] [INFO ] Redundant transitions in 19 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 05:46:45] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:46:45] [INFO ] Invariant cache hit.
[2024-05-23 05:46:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-23 05:46:59] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 3 ms to minimize.
[2024-05-23 05:47:00] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 33921ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 33933ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35668 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-23 05:47:19] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1683] Max Struct:[+inf]
RANDOM walk for 40009 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 522217 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 522217 steps, saw 320217 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 05:47:22] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:47:22] [INFO ] Invariant cache hit.
[2024-05-23 05:47:22] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3257 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 54 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 414/414 places, 1202/1202 transitions.
RANDOM walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540995 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 540995 steps, saw 331730 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-23 05:47:30] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:47:30] [INFO ] Invariant cache hit.
[2024-05-23 05:47:30] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 708ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3221 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 43 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 44 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-23 05:47:34] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:47:34] [INFO ] Invariant cache hit.
[2024-05-23 05:47:34] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 05:47:34] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:47:34] [INFO ] Invariant cache hit.
[2024-05-23 05:47:34] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:47:35] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1690 ms to find 0 implicit places.
[2024-05-23 05:47:35] [INFO ] Redundant transitions in 16 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 05:47:35] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:47:35] [INFO ] Invariant cache hit.
[2024-05-23 05:47:35] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-23 05:47:50] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:47:50] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 34308ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 34318ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36079 ms. Remains : 414/414 places, 1202/1202 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 534 rules applied. Total rules applied 534 place count 414 transition count 668
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 544 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 544 place count 404 transition count 600
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 680 place count 336 transition count 600
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 208 transition count 472
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 144 transition count 344
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 144 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 144 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 144 transition count 342
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1067 place count 143 transition count 342
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 80 transition count 216
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 80 transition count 216
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1256 place count 17 transition count 90
Iterating global reduction 3 with 63 rules applied. Total rules applied 1319 place count 17 transition count 90
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1382 place count 17 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1382 place count 17 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1384 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 16 transition count 24
Applied a total of 1386 rules in 30 ms. Remains 16 /414 variables (removed 398) and now considering 24/1202 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 16 cols
[2024-05-23 05:48:10] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 05:48:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 05:48:10] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:48:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:48:10] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:48:10] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:48:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 05:48:10] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:48:10] [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 05:48:10] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:48:10] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 149 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1683] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-10 in 140136 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:48:10] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-23 05:48:10] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:48:10] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:48:10] [INFO ] Invariant cache hit.
[2024-05-23 05:48:10] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2024-05-23 05:48:10] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2024-05-23 05:48:10] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:48:10] [INFO ] [Real]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 05:48:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:48:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:48:11] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 05:48:11] [INFO ] [Nat]Added 94 Read/Feed constraints in 52 ms returned sat
[2024-05-23 05:48:11] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 63 ms.
[2024-05-23 05:48:11] [INFO ] Added : 2 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 316 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 455 transition count 1299
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 455 transition count 1299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 455 transition count 1295
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 449 transition count 1279
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 449 transition count 1279
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 449 transition count 1275
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 444 transition count 1265
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 444 transition count 1265
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 439 transition count 1253
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 439 transition count 1253
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 434 transition count 1241
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 434 transition count 1241
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 429 transition count 1231
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 429 transition count 1231
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 425 transition count 1223
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 425 transition count 1223
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 421 transition count 1215
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 421 transition count 1215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 419 transition count 1211
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 419 transition count 1211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 417 transition count 1207
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 416 transition count 1205
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 416 transition count 1205
Applied a total of 100 rules in 147 ms. Remains 416 /462 variables (removed 46) and now considering 1205/1313 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 416/462 places, 1205/1313 transitions.
[2024-05-23 05:48:11] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 6 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2024-05-23 05:48:12] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2024-05-23 05:48:12] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2110 ms. (473 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 710 ms. (1406 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-23 05:48:15] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 05:48:15] [INFO ] Invariant cache hit.
[2024-05-23 05:48:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:48:15] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-23 05:48:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:48:15] [INFO ] [Real]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-23 05:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:48:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:48:15] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-23 05:48:15] [INFO ] [Nat]Added 75 Read/Feed constraints in 43 ms returned sat
[2024-05-23 05:48:15] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 3 ms to minimize.
[2024-05-23 05:48:15] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 3 ms to minimize.
[2024-05-23 05:48:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2024-05-23 05:48:16] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 59 ms.
[2024-05-23 05:48:16] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:48:16] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:48:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 434 ms
[2024-05-23 05:48:16] [INFO ] Added : 9 causal constraints over 4 iterations in 719 ms. Result :sat
Minimization took 275 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 42 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 42 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-23 05:48:17] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 05:48:17] [INFO ] Invariant cache hit.
[2024-05-23 05:48:17] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-23 05:48:17] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 05:48:17] [INFO ] Invariant cache hit.
[2024-05-23 05:48:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:48:18] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
[2024-05-23 05:48:18] [INFO ] Redundant transitions in 14 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-23 05:48:18] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 05:48:18] [INFO ] Invariant cache hit.
[2024-05-23 05:48:18] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-23 05:48:33] [INFO ] Deduced a trap composed of 135 places in 185 ms of which 2 ms to minimize.
[2024-05-23 05:48:33] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/421 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34294ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35949 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-23 05:48:53] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 40006 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 543237 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 543237 steps, saw 333106 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-23 05:48:56] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 05:48:56] [INFO ] Invariant cache hit.
[2024-05-23 05:48:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 05:48:57] [INFO ] Deduced a trap composed of 135 places in 188 ms of which 3 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/1096 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 964ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 186 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=93 )
Parikh walk visited 1 properties in 6 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[15] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-11 in 47177 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:48:57] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-23 05:48:57] [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 26 ms. (370 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 05:48:57] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:48:57] [INFO ] Invariant cache hit.
[2024-05-23 05:48:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:48:57] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 05:48:57] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:48:57] [INFO ] [Real]Added 94 Read/Feed constraints in 37 ms returned sat
[2024-05-23 05:48:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:48:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:48:58] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 05:48:58] [INFO ] [Nat]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-23 05:48:58] [INFO ] Deduced a trap composed of 133 places in 207 ms of which 3 ms to minimize.
[2024-05-23 05:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-05-23 05:48:58] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 72 ms.
[2024-05-23 05:48:58] [INFO ] Added : 1 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 285 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 447 transition count 1276
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 447 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 447 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 442 transition count 1262
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 442 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 437 transition count 1250
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 432 transition count 1238
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 432 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 73 place count 427 transition count 1228
Iterating global reduction 3 with 5 rules applied. Total rules applied 78 place count 427 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 423 transition count 1220
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 423 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 419 transition count 1212
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 417 transition count 1208
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 417 transition count 1208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 415 transition count 1204
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 414 transition count 1202
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 414 transition count 1202
Applied a total of 104 rules in 160 ms. Remains 414 /462 variables (removed 48) and now considering 1202/1313 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 414/462 places, 1202/1313 transitions.
[2024-05-23 05:48:58] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2024-05-23 05:48:59] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2024-05-23 05:48:59] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2198 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 759 ms. (1315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1809] Max Struct:[+inf]
[2024-05-23 05:49:02] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:49:02] [INFO ] Invariant cache hit.
[2024-05-23 05:49:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:49:02] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 05:49:02] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:49:02] [INFO ] [Real]Added 74 Read/Feed constraints in 35 ms returned sat
[2024-05-23 05:49:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:49:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:49:02] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-23 05:49:02] [INFO ] [Nat]Added 74 Read/Feed constraints in 27 ms returned sat
[2024-05-23 05:49:02] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 2 ms to minimize.
[2024-05-23 05:49:03] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 3 ms to minimize.
[2024-05-23 05:49:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2024-05-23 05:49:03] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 64 ms.
[2024-05-23 05:49:03] [INFO ] Added : 6 causal constraints over 3 iterations in 246 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1809] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1809] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 45 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 44 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-23 05:49:08] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:49:08] [INFO ] Invariant cache hit.
[2024-05-23 05:49:08] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-23 05:49:08] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:49:08] [INFO ] Invariant cache hit.
[2024-05-23 05:49:08] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:49:09] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
[2024-05-23 05:49:09] [INFO ] Redundant transitions in 17 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 05:49:09] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:49:09] [INFO ] Invariant cache hit.
[2024-05-23 05:49:09] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-23 05:49:23] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:49:24] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 33668ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 33679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35408 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-23 05:49:43] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1809] Max Struct:[+inf]
[2024-05-23 05:49:43] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:49:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1809] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2115 ms. (472 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 765 ms. (1305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1809] Max Struct:[+inf]
[2024-05-23 05:49:46] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:49:46] [INFO ] Invariant cache hit.
[2024-05-23 05:49:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:49:46] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-23 05:49:46] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:49:46] [INFO ] [Real]Added 74 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:49:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:49:47] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 05:49:47] [INFO ] [Nat]Added 74 Read/Feed constraints in 29 ms returned sat
[2024-05-23 05:49:47] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 3 ms to minimize.
[2024-05-23 05:49:47] [INFO ] Deduced a trap composed of 72 places in 192 ms of which 3 ms to minimize.
[2024-05-23 05:49:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2024-05-23 05:49:47] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 63 ms.
[2024-05-23 05:49:47] [INFO ] Added : 6 causal constraints over 3 iterations in 250 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1809] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1809] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 51 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 46 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-23 05:49:52] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:49:52] [INFO ] Invariant cache hit.
[2024-05-23 05:49:52] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-23 05:49:52] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:49:52] [INFO ] Invariant cache hit.
[2024-05-23 05:49:53] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:49:54] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
[2024-05-23 05:49:54] [INFO ] Redundant transitions in 15 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 05:49:54] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:49:54] [INFO ] Invariant cache hit.
[2024-05-23 05:49:54] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-23 05:50:08] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 2 ms to minimize.
[2024-05-23 05:50:09] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 34599ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 34611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36265 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-23 05:50:28] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1809] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 507164 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 507164 steps, saw 310988 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-23 05:50:32] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:50:32] [INFO ] Invariant cache hit.
[2024-05-23 05:50:32] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 694ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3498 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 43 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 414/414 places, 1202/1202 transitions.
RANDOM walk for 40005 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 510388 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 510388 steps, saw 312965 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-23 05:50:39] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:50:39] [INFO ] Invariant cache hit.
[2024-05-23 05:50:39] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3578 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 51 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 54 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-23 05:50:43] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:50:43] [INFO ] Invariant cache hit.
[2024-05-23 05:50:44] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-23 05:50:44] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:50:44] [INFO ] Invariant cache hit.
[2024-05-23 05:50:44] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 05:50:45] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
[2024-05-23 05:50:45] [INFO ] Redundant transitions in 20 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 05:50:45] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 05:50:45] [INFO ] Invariant cache hit.
[2024-05-23 05:50:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-23 05:50:59] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 2 ms to minimize.
[2024-05-23 05:51:00] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/419 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 34554ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 34567ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36260 ms. Remains : 414/414 places, 1202/1202 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 534 rules applied. Total rules applied 534 place count 414 transition count 668
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 544 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 544 place count 404 transition count 600
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 680 place count 336 transition count 600
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 208 transition count 472
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 144 transition count 344
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 144 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 144 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 144 transition count 342
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1067 place count 143 transition count 342
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 80 transition count 216
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 80 transition count 216
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1256 place count 17 transition count 90
Iterating global reduction 3 with 63 rules applied. Total rules applied 1319 place count 17 transition count 90
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1382 place count 17 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1382 place count 17 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1384 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 16 transition count 24
Applied a total of 1386 rules in 19 ms. Remains 16 /414 variables (removed 398) and now considering 24/1202 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 16 cols
[2024-05-23 05:51:20] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 05:51:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 05:51:20] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:51:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:51:20] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:51:20] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:51:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 05:51:20] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:51:20] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 05:51:20] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:51:20] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 83 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1809] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-12 in 142751 ms.
Starting property specific reduction for FunctionPointer-PT-c016-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:[16]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[16]
[2024-05-23 05:51:20] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-23 05:51:20] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[16]
RANDOM walk for 10002 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[16]
[2024-05-23 05:51:20] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:51:20] [INFO ] Invariant cache hit.
[2024-05-23 05:51:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:51:20] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-05-23 05:51:20] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:51:20] [INFO ] [Real]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-23 05:51:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:51:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:51:20] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-23 05:51:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 50 ms returned sat
[2024-05-23 05:51:20] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 67 ms.
[2024-05-23 05:51:21] [INFO ] Added : 1 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 341 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[16]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[16]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 452 transition count 1294
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 452 transition count 1294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 452 transition count 1290
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 446 transition count 1274
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 446 transition count 1274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 446 transition count 1270
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 45 place count 441 transition count 1260
Iterating global reduction 3 with 5 rules applied. Total rules applied 50 place count 441 transition count 1260
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 55 place count 436 transition count 1248
Iterating global reduction 3 with 5 rules applied. Total rules applied 60 place count 436 transition count 1248
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 431 transition count 1236
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 431 transition count 1236
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 75 place count 426 transition count 1226
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 426 transition count 1226
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 422 transition count 1218
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 422 transition count 1218
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 418 transition count 1210
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 418 transition count 1210
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 416 transition count 1206
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 416 transition count 1206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 414 transition count 1202
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 413 transition count 1200
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 413 transition count 1200
Applied a total of 106 rules in 130 ms. Remains 413 /462 variables (removed 49) and now considering 1200/1313 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 413/462 places, 1200/1313 transitions.
[2024-05-23 05:51:21] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-23 05:51:21] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[16]
RANDOM walk for 1000000 steps (2 resets) in 2130 ms. (469 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 783 ms. (1275 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[16]
[2024-05-23 05:51:24] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 05:51:24] [INFO ] Invariant cache hit.
[2024-05-23 05:51:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:51:24] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 05:51:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:51:24] [INFO ] [Real]Added 72 Read/Feed constraints in 46 ms returned sat
[2024-05-23 05:51:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:51:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:51:25] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 05:51:25] [INFO ] [Nat]Added 72 Read/Feed constraints in 38 ms returned sat
[2024-05-23 05:51:25] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 78 ms.
[2024-05-23 05:51:25] [INFO ] Added : 2 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[16]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[16]
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 45 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 45 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 72 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 05:51:25] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 05:51:25] [INFO ] Invariant cache hit.
[2024-05-23 05:51:26] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 05:51:26] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 05:51:26] [INFO ] Invariant cache hit.
[2024-05-23 05:51:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:51:27] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2024-05-23 05:51:27] [INFO ] Redundant transitions in 21 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 05:51:27] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 05:51:27] [INFO ] Invariant cache hit.
[2024-05-23 05:51:27] [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
[2024-05-23 05:51:41] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 2 ms to minimize.
[2024-05-23 05:51:42] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/418 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 34464ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 34476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36135 ms. Remains : 413/413 places, 1200/1200 transitions.
[2024-05-23 05:52:01] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 05:52:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[16]
FORMULA FunctionPointer-PT-c016-UpperBounds-13 16 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000005 steps (2 resets) in 2134 ms. (468 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-13 in 43768 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:52:03] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
// Phase 1: matrix 758 rows 462 cols
[2024-05-23 05:52:03] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 31 ms. (312 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 05:52:03] [INFO ] Flow matrix only has 758 transitions (discarded 555 similar events)
[2024-05-23 05:52:03] [INFO ] Invariant cache hit.
[2024-05-23 05:52:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:52:04] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 05:52:04] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 05:52:04] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-23 05:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:52:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:52:04] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-23 05:52:04] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 05:52:04] [INFO ] Computed and/alt/rep : 107/208/95 causal constraints (skipped 661 transitions) in 66 ms.
[2024-05-23 05:52:04] [INFO ] Deduced a trap composed of 139 places in 192 ms of which 3 ms to minimize.
[2024-05-23 05:52:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2024-05-23 05:52:05] [INFO ] Added : 3 causal constraints over 1 iterations in 463 ms. Result :sat
Minimization took 320 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 1313/1313 transitions.
Graph (complete) has 2247 edges and 462 vertex of which 459 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 459 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 453 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 453 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 453 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 448 transition count 1280
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 448 transition count 1280
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 448 transition count 1276
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 444 transition count 1268
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 444 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 48 place count 440 transition count 1258
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 440 transition count 1258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 436 transition count 1248
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 436 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 432 transition count 1240
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 429 transition count 1234
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 426 transition count 1228
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 424 transition count 1224
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 422 transition count 1220
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 421 transition count 1218
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 421 transition count 1218
Applied a total of 90 rules in 141 ms. Remains 421 /462 variables (removed 41) and now considering 1218/1313 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 421/462 places, 1218/1313 transitions.
[2024-05-23 05:52:05] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 05:52:05] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-23 05:52:05] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2463 ms. (405 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 831 ms. (1201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[520] Max Struct:[+inf]
[2024-05-23 05:52:09] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:52:09] [INFO ] Invariant cache hit.
[2024-05-23 05:52:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 05:52:09] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 05:52:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:52:09] [INFO ] [Real]Added 75 Read/Feed constraints in 66 ms returned sat
[2024-05-23 05:52:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:52:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:52:09] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-23 05:52:09] [INFO ] [Nat]Added 75 Read/Feed constraints in 47 ms returned sat
[2024-05-23 05:52:09] [INFO ] Deduced a trap composed of 113 places in 182 ms of which 2 ms to minimize.
[2024-05-23 05:52:10] [INFO ] Deduced a trap composed of 109 places in 186 ms of which 2 ms to minimize.
[2024-05-23 05:52:10] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 3 ms to minimize.
[2024-05-23 05:52:10] [INFO ] Deduced a trap composed of 85 places in 197 ms of which 2 ms to minimize.
[2024-05-23 05:52:10] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 2 ms to minimize.
[2024-05-23 05:52:11] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 3 ms to minimize.
[2024-05-23 05:52:11] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 3 ms to minimize.
[2024-05-23 05:52:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1520 ms
[2024-05-23 05:52:11] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 64 ms.
[2024-05-23 05:52:11] [INFO ] Added : 11 causal constraints over 3 iterations in 260 ms. Result :sat
Minimization took 302 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[520] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[520] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 50 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 05:52:11] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:52:11] [INFO ] Invariant cache hit.
[2024-05-23 05:52:12] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-23 05:52:12] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:52:12] [INFO ] Invariant cache hit.
[2024-05-23 05:52:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:52:13] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2024-05-23 05:52:13] [INFO ] Redundant transitions in 16 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 05:52:13] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:52:13] [INFO ] Invariant cache hit.
[2024-05-23 05:52:13] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 05:52:28] [INFO ] Deduced a trap composed of 135 places in 143 ms of which 3 ms to minimize.
[2024-05-23 05:52:28] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34428ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34441ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36045 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 05:52:47] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[520] Max Struct:[+inf]
[2024-05-23 05:52:48] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:52:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[520] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2520 ms. (396 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 779 ms. (1282 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[520] Max Struct:[+inf]
[2024-05-23 05:52:51] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:52:51] [INFO ] Invariant cache hit.
[2024-05-23 05:52:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:52:51] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 05:52:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:52:51] [INFO ] [Real]Added 75 Read/Feed constraints in 68 ms returned sat
[2024-05-23 05:52:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 05:52:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:52:52] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 05:52:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 47 ms returned sat
[2024-05-23 05:52:52] [INFO ] Deduced a trap composed of 113 places in 200 ms of which 4 ms to minimize.
[2024-05-23 05:52:52] [INFO ] Deduced a trap composed of 109 places in 186 ms of which 2 ms to minimize.
[2024-05-23 05:52:52] [INFO ] Deduced a trap composed of 87 places in 187 ms of which 3 ms to minimize.
[2024-05-23 05:52:52] [INFO ] Deduced a trap composed of 85 places in 187 ms of which 3 ms to minimize.
[2024-05-23 05:52:53] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 3 ms to minimize.
[2024-05-23 05:52:53] [INFO ] Deduced a trap composed of 70 places in 202 ms of which 3 ms to minimize.
[2024-05-23 05:52:53] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 3 ms to minimize.
[2024-05-23 05:52:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1513 ms
[2024-05-23 05:52:53] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 70 ms.
[2024-05-23 05:52:53] [INFO ] Added : 11 causal constraints over 3 iterations in 249 ms. Result :sat
Minimization took 262 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[520] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[520] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 48 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 47 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 05:52:54] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:52:54] [INFO ] Invariant cache hit.
[2024-05-23 05:52:54] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-23 05:52:54] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:52:54] [INFO ] Invariant cache hit.
[2024-05-23 05:52:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:52:55] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
[2024-05-23 05:52:55] [INFO ] Redundant transitions in 16 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 05:52:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:52:55] [INFO ] Invariant cache hit.
[2024-05-23 05:52:55] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 05:53:10] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 2 ms to minimize.
[2024-05-23 05:53:10] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34213ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34225ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35874 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 05:53:30] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[520] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 549626 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 549626 steps, saw 337022 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-23 05:53:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:53:33] [INFO ] Invariant cache hit.
[2024-05-23 05:53:33] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2769 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 549126 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 549126 steps, saw 336717 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-23 05:53:39] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:53:39] [INFO ] Invariant cache hit.
[2024-05-23 05:53:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 668ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2781 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 05:53:43] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:53:43] [INFO ] Invariant cache hit.
[2024-05-23 05:53:43] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-23 05:53:43] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:53:43] [INFO ] Invariant cache hit.
[2024-05-23 05:53:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 05:53:45] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
[2024-05-23 05:53:45] [INFO ] Redundant transitions in 23 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 05:53:45] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 05:53:45] [INFO ] Invariant cache hit.
[2024-05-23 05:53:45] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 05:53:59] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 3 ms to minimize.
[2024-05-23 05:54:00] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34379ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34390ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36086 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 20 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 05:54:19] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 05:54:19] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 05:54:19] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:54:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:54:19] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:54:19] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:54:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 05:54:19] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:54:19] [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 05:54:19] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:54:19] [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 94 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[520] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-14 in 135612 ms.
[2024-05-23 05:54:19] [INFO ] Flatten gal took : 116 ms
[2024-05-23 05:54:19] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2024-05-23 05:54:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 462 places, 1313 transitions and 5380 arcs took 10 ms.
Total runtime 1707546 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FunctionPointer-PT-c016
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 462
TRANSITIONS: 1313
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.030s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/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: 2348
MODEL NAME: /home/mcc/execution/412/model
462 places, 1313 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 1716443674034
--------------------
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-c016"
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-c016, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601200301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;