About the Execution of 2023-gold for FunctionPointer-PT-b008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16221.991 | 3600000.00 | 3620910.00 | 33290.40 | ? ? 8 ? ? ? ? 8 ? ? ? 1 ? ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625000146.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 gold2023
Input is FunctionPointer-PT-b008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625000146
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 16:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 11 16:05 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:26 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 391K 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-b008-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716517396982
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b008
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 02:23:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 02:23:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:23:18] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-24 02:23:18] [INFO ] Transformed 306 places.
[2024-05-24 02:23:18] [INFO ] Transformed 840 transitions.
[2024-05-24 02:23:18] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Normalized transition count is 414 out of 648 initially.
// Phase 1: matrix 414 rows 222 cols
[2024-05-24 02:23:18] [INFO ] Computed 4 invariants in 31 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :81
FORMULA FunctionPointer-PT-b008-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-02 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :16
[2024-05-24 02:23:18] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-24 02:23:18] [INFO ] Computed 4 invariants in 8 ms
[2024-05-24 02:23:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 02:23:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:19] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-24 02:23:19] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-24 02:23:19] [INFO ] [Real]Added 65 Read/Feed constraints in 15 ms returned sat
[2024-05-24 02:23:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 02:23:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:19] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-24 02:23:19] [INFO ] [Nat]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-24 02:23:19] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 3 ms to minimize.
[2024-05-24 02:23:19] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2024-05-24 02:23:19] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-05-24 02:23:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 394 ms
[2024-05-24 02:23:19] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 54 ms.
[2024-05-24 02:23:19] [INFO ] Added : 3 causal constraints over 1 iterations in 121 ms. Result :sat
Minimization took 36 ms.
[2024-05-24 02:23:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 02:23:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:20] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-24 02:23:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:20] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-24 02:23:20] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:23:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-05-24 02:23:20] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 46 ms.
[2024-05-24 02:23:20] [INFO ] Added : 1 causal constraints over 1 iterations in 95 ms. Result :sat
Minimization took 29 ms.
[2024-05-24 02:23:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:20] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-24 02:23:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:20] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-24 02:23:20] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-24 02:23:20] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 1 ms to minimize.
[2024-05-24 02:23:21] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2024-05-24 02:23:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2024-05-24 02:23:21] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 38 ms.
[2024-05-24 02:23:21] [INFO ] Added : 2 causal constraints over 1 iterations in 87 ms. Result :sat
Minimization took 33 ms.
[2024-05-24 02:23:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:21] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-24 02:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:21] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Nat]Added 65 Read/Feed constraints in 14 ms returned sat
[2024-05-24 02:23:21] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 31 ms.
[2024-05-24 02:23:21] [INFO ] Added : 2 causal constraints over 1 iterations in 88 ms. Result :sat
Minimization took 22 ms.
[2024-05-24 02:23:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:21] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Real]Added 65 Read/Feed constraints in 12 ms returned sat
[2024-05-24 02:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:21] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-24 02:23:21] [INFO ] [Nat]Added 65 Read/Feed constraints in 12 ms returned sat
[2024-05-24 02:23:21] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2024-05-24 02:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-24 02:23:22] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 29 ms.
[2024-05-24 02:23:22] [INFO ] Added : 2 causal constraints over 1 iterations in 78 ms. Result :sat
Minimization took 32 ms.
[2024-05-24 02:23:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:22] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-24 02:23:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:22] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-24 02:23:22] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-05-24 02:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-24 02:23:22] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 26 ms.
[2024-05-24 02:23:22] [INFO ] Added : 1 causal constraints over 1 iterations in 84 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 02:23:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:22] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-24 02:23:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:22] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-24 02:23:22] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-24 02:23:22] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2024-05-24 02:23:23] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-24 02:23:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2024-05-24 02:23:23] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2024-05-24 02:23:23] [INFO ] Added : 2 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 32 ms.
[2024-05-24 02:23:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:23] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-24 02:23:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:23] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-24 02:23:23] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 29 ms.
[2024-05-24 02:23:23] [INFO ] Added : 1 causal constraints over 1 iterations in 99 ms. Result :sat
Minimization took 23 ms.
[2024-05-24 02:23:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:23] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-24 02:23:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:23] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-24 02:23:23] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-24 02:23:23] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-05-24 02:23:24] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2024-05-24 02:23:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2024-05-24 02:23:24] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 24 ms.
[2024-05-24 02:23:24] [INFO ] Added : 1 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 23 ms.
[2024-05-24 02:23:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:24] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-24 02:23:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:24] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-24 02:23:24] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-24 02:23:24] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 0 ms to minimize.
[2024-05-24 02:23:24] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2024-05-24 02:23:24] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 0 ms to minimize.
[2024-05-24 02:23:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 297 ms
[2024-05-24 02:23:24] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2024-05-24 02:23:24] [INFO ] Added : 2 causal constraints over 1 iterations in 68 ms. Result :sat
Minimization took 36 ms.
[2024-05-24 02:23:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:24] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-24 02:23:24] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-24 02:23:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:25] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Nat]Added 65 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:25] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2024-05-24 02:23:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-24 02:23:25] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 23 ms.
[2024-05-24 02:23:25] [INFO ] Added : 1 causal constraints over 1 iterations in 65 ms. Result :sat
Minimization took 37 ms.
[2024-05-24 02:23:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:25] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-24 02:23:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:25] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-24 02:23:25] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2024-05-24 02:23:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-24 02:23:25] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 29 ms.
[2024-05-24 02:23:25] [INFO ] Added : 1 causal constraints over 1 iterations in 68 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 02:23:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:25] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-24 02:23:25] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-24 02:23:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:26] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-24 02:23:26] [INFO ] [Nat]Added 65 Read/Feed constraints in 13 ms returned sat
[2024-05-24 02:23:26] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 24 ms.
[2024-05-24 02:23:26] [INFO ] Added : 1 causal constraints over 1 iterations in 63 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[8, 15, 4, 9, 9, 6, 2, 2, 5, 7, 9, 2, 3]
Support contains 13 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 200 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 200 transition count 622
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 54 place count 173 transition count 462
Iterating global reduction 1 with 27 rules applied. Total rules applied 81 place count 173 transition count 462
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 107 place count 173 transition count 436
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 123 place count 157 transition count 404
Iterating global reduction 2 with 16 rules applied. Total rules applied 139 place count 157 transition count 404
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 143 place count 157 transition count 400
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 150 place count 150 transition count 386
Iterating global reduction 3 with 7 rules applied. Total rules applied 157 place count 150 transition count 386
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 162 place count 145 transition count 366
Iterating global reduction 3 with 5 rules applied. Total rules applied 167 place count 145 transition count 366
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 171 place count 141 transition count 358
Iterating global reduction 3 with 4 rules applied. Total rules applied 175 place count 141 transition count 358
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 137 transition count 342
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 137 transition count 342
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 134 transition count 330
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 134 transition count 330
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 131 transition count 324
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 131 transition count 324
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 128 transition count 318
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 128 transition count 318
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 204 place count 125 transition count 312
Iterating global reduction 3 with 3 rules applied. Total rules applied 207 place count 125 transition count 312
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 123 transition count 308
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 123 transition count 308
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 122 transition count 306
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 122 transition count 306
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 122 transition count 296
Applied a total of 223 rules in 131 ms. Remains 122 /222 variables (removed 100) and now considering 296/648 (removed 352) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 122/222 places, 296/648 transitions.
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:23:26] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 5 resets, run finished after 1311 ms. (steps per millisecond=762 ) properties (out of 13) seen :62
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 1000001 steps, including 11 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 13) seen :791
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 604 ms. (steps per millisecond=1655 ) properties (out of 13) seen :50
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 13) seen :45
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 13) seen :40
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 558 ms. (steps per millisecond=1792 ) properties (out of 13) seen :612
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties (out of 13) seen :244
Incomplete Best-First random walk after 1000000 steps, including 8 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 13) seen :315
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 13) seen :774
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 13) seen :49
Incomplete Best-First random walk after 1000000 steps, including 5 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 13) seen :478
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 13) seen :263
Incomplete Best-First random walk after 1000001 steps, including 7 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 13) seen :427
[2024-05-24 02:23:35] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:23:35] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 02:23:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:35] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-24 02:23:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:35] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:23:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:23:35] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2024-05-24 02:23:35] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 13 ms.
[2024-05-24 02:23:35] [INFO ] Added : 2 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 02:23:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:35] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:35] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:35] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:35] [INFO ] Added : 1 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 12 ms.
[2024-05-24 02:23:35] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:35] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:35] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 02:23:35] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2024-05-24 02:23:35] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 10 ms.
[2024-05-24 02:23:35] [INFO ] Added : 2 causal constraints over 1 iterations in 34 ms. Result :sat
Minimization took 19 ms.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:36] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:36] [INFO ] Added : 2 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 13 ms.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:36] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 13 ms.
[2024-05-24 02:23:36] [INFO ] Added : 2 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 13 ms.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:36] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:36] [INFO ] Added : 1 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 14 ms.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:36] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:36] [INFO ] Added : 12 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 18 ms.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:23:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:36] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:37] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:37] [INFO ] Added : 7 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 16 ms.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:23:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:23:37] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 10 ms.
[2024-05-24 02:23:37] [INFO ] Added : 1 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 13 ms.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 02:23:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:23:37] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:37] [INFO ] Added : 2 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:37] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 10 ms.
[2024-05-24 02:23:37] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 18 ms.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:37] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:37] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 12 ms.
[2024-05-24 02:23:37] [INFO ] Added : 11 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 18 ms.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:37] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:23:37] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:23:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:38] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-24 02:23:38] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:38] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 13 ms.
[2024-05-24 02:23:38] [INFO ] Added : 13 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[8, 750, 8, 9, 9, 582, 200, 277, 738, 7, 441, 218, 387]
Support contains 13 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 122/122 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-24 02:23:41] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
[2024-05-24 02:23:41] [INFO ] Invariant cache hit.
[2024-05-24 02:23:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-24 02:23:41] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
[2024-05-24 02:23:41] [INFO ] Invariant cache hit.
[2024-05-24 02:23:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:23:42] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-24 02:23:42] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 02:23:42] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
[2024-05-24 02:23:42] [INFO ] Invariant cache hit.
[2024-05-24 02:23:42] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 122/122 places, 296/296 transitions.
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:23:42] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1225 ms. (steps per millisecond=816 ) properties (out of 13) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 13) seen :31
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 13) seen :29
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 13) seen :51
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 558 ms. (steps per millisecond=1792 ) properties (out of 13) seen :44
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 13) seen :35
Incomplete Best-First random walk after 1000001 steps, including 11 resets, run finished after 580 ms. (steps per millisecond=1724 ) properties (out of 13) seen :330
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 13) seen :203
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 13) seen :36
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties (out of 13) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 13) seen :44
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 591 ms. (steps per millisecond=1692 ) properties (out of 13) seen :409
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 13) seen :238
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 570 ms. (steps per millisecond=1754 ) properties (out of 13) seen :486
[2024-05-24 02:23:50] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:23:50] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 02:23:50] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:50] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-24 02:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:50] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:23:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:23:50] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2024-05-24 02:23:50] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 12 ms.
[2024-05-24 02:23:50] [INFO ] Added : 2 causal constraints over 1 iterations in 34 ms. Result :sat
Minimization took 19 ms.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Added 43 Read/Feed constraints in 7 ms returned sat
[2024-05-24 02:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:23:51] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:51] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 14 ms.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:51] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 12 ms.
[2024-05-24 02:23:51] [INFO ] Added : 2 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 16 ms.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:51] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:51] [INFO ] Added : 2 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:51] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:51] [INFO ] Added : 2 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 13 ms.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:51] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-24 02:23:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:51] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 10 ms.
[2024-05-24 02:23:51] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 12 ms.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:52] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 13 ms.
[2024-05-24 02:23:52] [INFO ] Added : 12 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 16 ms.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 12 ms returned sat
[2024-05-24 02:23:52] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 13 ms.
[2024-05-24 02:23:52] [INFO ] Added : 7 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:23:52] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 10 ms.
[2024-05-24 02:23:52] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 15 ms.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:52] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:52] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 12 ms.
[2024-05-24 02:23:52] [INFO ] Added : 2 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 23 ms.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:52] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 02:23:52] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:53] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Nat]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:23:53] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:23:53] [INFO ] Added : 1 causal constraints over 1 iterations in 34 ms. Result :sat
Minimization took 16 ms.
[2024-05-24 02:23:53] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:53] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:53] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:53] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 10 ms.
[2024-05-24 02:23:53] [INFO ] Added : 11 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 18 ms.
[2024-05-24 02:23:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:53] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:23:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:23:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:23:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-24 02:23:53] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:23:53] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 10 ms.
[2024-05-24 02:23:53] [INFO ] Added : 13 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[8, 750, 8, 9, 9, 582, 200, 277, 738, 7, 441, 218, 11634]
Support contains 13 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Applied a total of 0 rules in 25 ms. Remains 122 /122 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 122/122 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-24 02:24:19] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
[2024-05-24 02:24:19] [INFO ] Invariant cache hit.
[2024-05-24 02:24:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-24 02:24:19] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
[2024-05-24 02:24:19] [INFO ] Invariant cache hit.
[2024-05-24 02:24:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:24:20] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-24 02:24:20] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 02:24:20] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
[2024-05-24 02:24:20] [INFO ] Invariant cache hit.
[2024-05-24 02:24:20] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 122/122 places, 296/296 transitions.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-00
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:20] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :8
[2024-05-24 02:24:20] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 02:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:20] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:20] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:24:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:24:20] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2024-05-24 02:24:20] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:24:20] [INFO ] Added : 2 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[8]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 113 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 113 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 105 transition count 259
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 105 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 105 transition count 255
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 100 transition count 243
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 100 transition count 243
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 96 transition count 231
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 96 transition count 231
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 92 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 92 transition count 223
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 88 transition count 215
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 88 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 84 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 84 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 81 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 81 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 78 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 78 transition count 195
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 76 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 76 transition count 191
Applied a total of 96 rules in 32 ms. Remains 76 /122 variables (removed 46) and now considering 191/296 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 76/122 places, 191/296 transitions.
Normalized transition count is 117 out of 191 initially.
// Phase 1: matrix 117 rows 76 cols
[2024-05-24 02:24:20] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :5
[2024-05-24 02:24:21] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-24 02:24:21] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:24:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:21] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:21] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:21] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:21] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 02:24:21] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:21] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-24 02:24:21] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-24 02:24:21] [INFO ] Added : 8 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[8]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-24 02:24:21] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-24 02:24:21] [INFO ] Invariant cache hit.
[2024-05-24 02:24:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 02:24:22] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-24 02:24:22] [INFO ] Invariant cache hit.
[2024-05-24 02:24:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:22] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-24 02:24:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 02:24:22] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-24 02:24:22] [INFO ] Invariant cache hit.
[2024-05-24 02:24:22] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 76/76 places, 191/191 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-00 in 1935 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-01
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:22] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-24 02:24:22] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:22] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:22] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:24:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:22] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:24:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:24:22] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:22] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:24:22] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 110 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 110 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 103 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 103 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 103 transition count 252
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 98 transition count 240
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 98 transition count 240
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 94 transition count 228
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 94 transition count 228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 90 transition count 220
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 90 transition count 220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 86 transition count 212
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 86 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 82 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 82 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 79 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 79 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 76 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 76 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 74 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 74 transition count 188
Applied a total of 99 rules in 30 ms. Remains 74 /122 variables (removed 48) and now considering 188/296 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 74/122 places, 188/296 transitions.
Normalized transition count is 115 out of 188 initially.
// Phase 1: matrix 115 rows 74 cols
[2024-05-24 02:24:22] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=2314 ) properties (out of 1) seen :1966
[2024-05-24 02:24:23] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
// Phase 1: matrix 115 rows 74 cols
[2024-05-24 02:24:23] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:24:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:24:23] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:23] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:23] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:23] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 5 ms.
[2024-05-24 02:24:23] [INFO ] Added : 5 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1966]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 11 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 12 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-24 02:24:25] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-24 02:24:25] [INFO ] Invariant cache hit.
[2024-05-24 02:24:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 02:24:25] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-24 02:24:25] [INFO ] Invariant cache hit.
[2024-05-24 02:24:25] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:25] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-24 02:24:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:24:25] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-24 02:24:25] [INFO ] Invariant cache hit.
[2024-05-24 02:24:25] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 74/74 places, 188/188 transitions.
Normalized transition count is 115 out of 188 initially.
// Phase 1: matrix 115 rows 74 cols
[2024-05-24 02:24:25] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 897 ms. (steps per millisecond=1114 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 1) seen :1917
[2024-05-24 02:24:26] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
// Phase 1: matrix 115 rows 74 cols
[2024-05-24 02:24:26] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:24:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:26] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:24:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:26] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:26] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-24 02:24:26] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:26] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 6 ms.
[2024-05-24 02:24:26] [INFO ] Added : 5 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1966]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 9 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-24 02:24:28] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-24 02:24:28] [INFO ] Invariant cache hit.
[2024-05-24 02:24:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 02:24:28] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-24 02:24:28] [INFO ] Invariant cache hit.
[2024-05-24 02:24:28] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:28] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-24 02:24:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:24:28] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-24 02:24:28] [INFO ] Invariant cache hit.
[2024-05-24 02:24:28] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 74/74 places, 188/188 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-01 in 6223 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-03
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:28] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2024-05-24 02:24:28] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 02:24:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:28] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 02:24:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:24:28] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:28] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:24:28] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2024-05-24 02:24:28] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 12 ms.
[2024-05-24 02:24:28] [INFO ] Added : 2 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 113 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 113 transition count 280
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 105 transition count 260
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 105 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 105 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 42 place count 100 transition count 244
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 100 transition count 244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 96 transition count 232
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 96 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 92 transition count 224
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 92 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 88 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 88 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 84 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 84 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 81 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 81 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 78 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 78 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 76 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 76 transition count 192
Applied a total of 95 rules in 16 ms. Remains 76 /122 variables (removed 46) and now considering 192/296 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 76/122 places, 192/296 transitions.
Normalized transition count is 118 out of 192 initially.
// Phase 1: matrix 118 rows 76 cols
[2024-05-24 02:24:28] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 1) seen :1
[2024-05-24 02:24:29] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-24 02:24:29] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 02:24:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 02:24:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:30] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:30] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:30] [INFO ] Computed and/alt/rep : 62/198/53 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:24:30] [INFO ] Added : 6 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[8]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:24:30] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:30] [INFO ] Invariant cache hit.
[2024-05-24 02:24:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 02:24:30] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:30] [INFO ] Invariant cache hit.
[2024-05-24 02:24:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:30] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-24 02:24:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:24:30] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:30] [INFO ] Invariant cache hit.
[2024-05-24 02:24:30] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 76/76 places, 192/192 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-03 in 1938 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-04
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:30] [INFO ] Computed 2 invariants in 0 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2024-05-24 02:24:30] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:30] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 02:24:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:30] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 02:24:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:24:30] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:30] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 02:24:30] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:24:30] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 16 ms.
[2024-05-24 02:24:30] [INFO ] Added : 2 causal constraints over 1 iterations in 41 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 113 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 113 transition count 280
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 105 transition count 260
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 105 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 105 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 42 place count 100 transition count 244
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 100 transition count 244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 96 transition count 232
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 96 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 92 transition count 224
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 92 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 88 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 88 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 84 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 84 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 81 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 81 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 78 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 78 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 76 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 76 transition count 192
Applied a total of 95 rules in 31 ms. Remains 76 /122 variables (removed 46) and now considering 192/296 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 76/122 places, 192/296 transitions.
Normalized transition count is 118 out of 192 initially.
// Phase 1: matrix 118 rows 76 cols
[2024-05-24 02:24:30] [INFO ] Computed 2 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 925 ms. (steps per millisecond=1081 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 423 ms. (steps per millisecond=2364 ) properties (out of 1) seen :4
[2024-05-24 02:24:32] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-24 02:24:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 02:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:32] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-24 02:24:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:32] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:32] [INFO ] Computed and/alt/rep : 62/198/53 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-24 02:24:32] [INFO ] Added : 5 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[7]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:24:32] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:32] [INFO ] Invariant cache hit.
[2024-05-24 02:24:32] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-24 02:24:32] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:32] [INFO ] Invariant cache hit.
[2024-05-24 02:24:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:32] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-24 02:24:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:24:32] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:32] [INFO ] Invariant cache hit.
[2024-05-24 02:24:32] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 76/76 places, 192/192 transitions.
Normalized transition count is 118 out of 192 initially.
// Phase 1: matrix 118 rows 76 cols
[2024-05-24 02:24:32] [INFO ] Computed 2 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 1) seen :6
[2024-05-24 02:24:33] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-24 02:24:33] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 02:24:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:33] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:24:33] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:33] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:24:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:33] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:33] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:24:33] [INFO ] Computed and/alt/rep : 62/198/53 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:24:33] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[8]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:24:33] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:33] [INFO ] Invariant cache hit.
[2024-05-24 02:24:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-24 02:24:33] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:33] [INFO ] Invariant cache hit.
[2024-05-24 02:24:33] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:34] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-24 02:24:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:24:34] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:34] [INFO ] Invariant cache hit.
[2024-05-24 02:24:34] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 76/76 places, 192/192 transitions.
Normalized transition count is 118 out of 192 initially.
// Phase 1: matrix 118 rows 76 cols
[2024-05-24 02:24:34] [INFO ] Computed 2 invariants in 4 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 1) seen :7
[2024-05-24 02:24:35] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-24 02:24:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:35] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:35] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:24:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:35] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:24:35] [INFO ] Computed and/alt/rep : 62/198/53 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:24:35] [INFO ] Added : 9 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[9]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:24:35] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:35] [INFO ] Invariant cache hit.
[2024-05-24 02:24:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-24 02:24:35] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:35] [INFO ] Invariant cache hit.
[2024-05-24 02:24:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:35] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-24 02:24:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:24:35] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-24 02:24:35] [INFO ] Invariant cache hit.
[2024-05-24 02:24:35] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 76/76 places, 192/192 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-04 in 5379 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-05
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:35] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-24 02:24:35] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:35] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 02:24:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:35] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:24:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:24:35] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:24:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:35] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 02:24:35] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:24:35] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 12 ms.
[2024-05-24 02:24:35] [INFO ] Added : 2 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[12]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 113 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 113 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 105 transition count 259
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 105 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 105 transition count 255
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 100 transition count 243
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 100 transition count 243
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 96 transition count 231
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 96 transition count 231
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 92 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 92 transition count 223
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 88 transition count 215
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 88 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 84 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 84 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 81 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 81 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 78 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 78 transition count 195
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 76 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 76 transition count 191
Applied a total of 96 rules in 18 ms. Remains 76 /122 variables (removed 46) and now considering 191/296 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 76/122 places, 191/296 transitions.
Normalized transition count is 117 out of 191 initially.
// Phase 1: matrix 117 rows 76 cols
[2024-05-24 02:24:36] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 1) seen :1
[2024-05-24 02:24:37] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-24 02:24:37] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 02:24:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 02:24:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:37] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:37] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:37] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-24 02:24:37] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-24 02:24:37] [INFO ] Added : 11 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[12]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-24 02:24:37] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-24 02:24:37] [INFO ] Invariant cache hit.
[2024-05-24 02:24:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-24 02:24:37] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-24 02:24:37] [INFO ] Invariant cache hit.
[2024-05-24 02:24:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-24 02:24:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:24:37] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-24 02:24:37] [INFO ] Invariant cache hit.
[2024-05-24 02:24:37] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 76/76 places, 191/191 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-05 in 2037 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-06
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:37] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2024-05-24 02:24:37] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:37] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:24:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:24:37] [INFO ] [Real]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:37] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:24:37] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:37] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 10 ms.
[2024-05-24 02:24:37] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 110 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 110 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 103 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 103 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 103 transition count 254
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 98 transition count 242
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 98 transition count 242
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 94 transition count 230
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 94 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 90 transition count 222
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 90 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 86 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 86 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 82 transition count 206
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 82 transition count 206
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 79 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 79 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 76 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 76 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 75 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 75 transition count 192
Applied a total of 95 rules in 15 ms. Remains 75 /122 variables (removed 47) and now considering 192/296 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 75/122 places, 192/296 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:24:38] [INFO ] Computed 3 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 1) seen :675
[2024-05-24 02:24:39] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:24:39] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:24:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 02:24:39] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:39] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:24:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:39] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 02:24:39] [INFO ] [Nat]Added 17 Read/Feed constraints in 1 ms returned sat
[2024-05-24 02:24:39] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-24 02:24:39] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-24 02:24:39] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:24:39] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-24 02:24:39] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:24:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 237 ms
[2024-05-24 02:24:39] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:24:39] [INFO ] Added : 8 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[675]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:24:40] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:24:40] [INFO ] Invariant cache hit.
[2024-05-24 02:24:40] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-24 02:24:40] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:24:40] [INFO ] Invariant cache hit.
[2024-05-24 02:24:40] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:40] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-24 02:24:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:24:40] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:24:40] [INFO ] Invariant cache hit.
[2024-05-24 02:24:40] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 75/75 places, 192/192 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:24:40] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 841 ms. (steps per millisecond=1189 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 1) seen :892
[2024-05-24 02:24:41] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:24:41] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 02:24:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:41] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:41] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:24:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 02:24:41] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:24:41] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-24 02:24:42] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:24:42] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-24 02:24:42] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:24:42] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:24:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 213 ms
[2024-05-24 02:24:42] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 8 ms.
[2024-05-24 02:24:42] [INFO ] Added : 8 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[892]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:24:42] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:24:42] [INFO ] Invariant cache hit.
[2024-05-24 02:24:42] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 02:24:42] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:24:42] [INFO ] Invariant cache hit.
[2024-05-24 02:24:42] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:42] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-24 02:24:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:24:43] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:24:43] [INFO ] Invariant cache hit.
[2024-05-24 02:24:43] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 75/75 places, 192/192 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:24:43] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 1) seen :679
[2024-05-24 02:24:44] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:24:44] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 02:24:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:44] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:44] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:44] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:24:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:44] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:44] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:24:44] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:24:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:24:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:24:44] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-24 02:24:44] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:24:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 199 ms
[2024-05-24 02:24:44] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:24:44] [INFO ] Added : 8 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[892]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:24:45] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:24:45] [INFO ] Invariant cache hit.
[2024-05-24 02:24:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 02:24:45] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:24:45] [INFO ] Invariant cache hit.
[2024-05-24 02:24:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:24:45] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-24 02:24:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:24:45] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:24:45] [INFO ] Invariant cache hit.
[2024-05-24 02:24:45] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 75/75 places, 192/192 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-06 in 7866 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-08
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:45] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2024-05-24 02:24:45] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:45] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:45] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:24:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:45] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:24:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:24:45] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:45] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:24:45] [INFO ] Added : 11 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[7]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 110 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 110 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 103 transition count 258
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 103 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 103 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 99 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 99 transition count 244
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 96 transition count 236
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 96 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 93 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 93 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 90 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 90 transition count 224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 87 transition count 218
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 87 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 85 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 85 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 83 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 83 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 82 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 82 transition count 208
Applied a total of 83 rules in 16 ms. Remains 82 /122 variables (removed 40) and now considering 208/296 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 82/122 places, 208/296 transitions.
Normalized transition count is 128 out of 208 initially.
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:45] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 1) seen :242
[2024-05-24 02:24:47] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:47] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 02:24:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:47] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 02:24:47] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:47] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:24:47] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:24:47] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 6 ms.
[2024-05-24 02:24:47] [INFO ] Added : 22 causal constraints over 6 iterations in 62 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[242]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-24 02:24:47] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:47] [INFO ] Invariant cache hit.
[2024-05-24 02:24:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 02:24:47] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:47] [INFO ] Invariant cache hit.
[2024-05-24 02:24:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:48] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-24 02:24:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:24:48] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:48] [INFO ] Invariant cache hit.
[2024-05-24 02:24:48] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 82/82 places, 208/208 transitions.
Normalized transition count is 128 out of 208 initially.
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:48] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 1) seen :243
[2024-05-24 02:24:49] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:49] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 02:24:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:49] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:49] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:49] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:24:49] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 10 ms.
[2024-05-24 02:24:49] [INFO ] Added : 22 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[243]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-24 02:24:50] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:50] [INFO ] Invariant cache hit.
[2024-05-24 02:24:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-24 02:24:50] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:50] [INFO ] Invariant cache hit.
[2024-05-24 02:24:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:50] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-24 02:24:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:24:50] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:50] [INFO ] Invariant cache hit.
[2024-05-24 02:24:50] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 82/82 places, 208/208 transitions.
Normalized transition count is 128 out of 208 initially.
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:50] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 480 ms. (steps per millisecond=2083 ) properties (out of 1) seen :223
[2024-05-24 02:24:51] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:51] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:24:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:51] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:51] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 02:24:51] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:51] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 7 ms.
[2024-05-24 02:24:52] [INFO ] Added : 22 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[243]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-24 02:24:52] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:52] [INFO ] Invariant cache hit.
[2024-05-24 02:24:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 02:24:52] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:52] [INFO ] Invariant cache hit.
[2024-05-24 02:24:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:52] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-24 02:24:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:24:52] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:52] [INFO ] Invariant cache hit.
[2024-05-24 02:24:52] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 82/82 places, 208/208 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-08 in 7076 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-09
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:52] [INFO ] Computed 2 invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2024-05-24 02:24:52] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:24:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:24:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:52] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:24:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:24:52] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:24:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:24:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:52] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-24 02:24:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:24:52] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 16 ms.
[2024-05-24 02:24:52] [INFO ] Added : 6 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[9]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 110 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 110 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 103 transition count 258
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 103 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 103 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 99 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 99 transition count 244
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 96 transition count 236
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 96 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 93 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 93 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 90 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 90 transition count 224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 87 transition count 218
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 87 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 85 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 85 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 83 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 83 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 82 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 82 transition count 208
Applied a total of 83 rules in 12 ms. Remains 82 /122 variables (removed 40) and now considering 208/296 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 82/122 places, 208/296 transitions.
Normalized transition count is 128 out of 208 initially.
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:53] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 1) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=1980 ) properties (out of 1) seen :221
[2024-05-24 02:24:54] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:54] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:24:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:54] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-24 02:24:54] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:54] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 02:24:54] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:54] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 4 ms to minimize.
[2024-05-24 02:24:54] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:24:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-24 02:24:54] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 6 ms.
[2024-05-24 02:24:54] [INFO ] Added : 25 causal constraints over 7 iterations in 63 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[221]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-24 02:24:55] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:55] [INFO ] Invariant cache hit.
[2024-05-24 02:24:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-24 02:24:55] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:55] [INFO ] Invariant cache hit.
[2024-05-24 02:24:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:55] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-24 02:24:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:24:55] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:55] [INFO ] Invariant cache hit.
[2024-05-24 02:24:55] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 82/82 places, 208/208 transitions.
Normalized transition count is 128 out of 208 initially.
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:55] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 1) seen :249
[2024-05-24 02:24:56] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 02:24:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:56] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 02:24:56] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:56] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:56] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:24:56] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-24 02:24:56] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 02:24:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-24 02:24:57] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 8 ms.
[2024-05-24 02:24:57] [INFO ] Added : 25 causal constraints over 7 iterations in 64 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[249]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-24 02:24:57] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:57] [INFO ] Invariant cache hit.
[2024-05-24 02:24:57] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-24 02:24:57] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:57] [INFO ] Invariant cache hit.
[2024-05-24 02:24:57] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:57] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-24 02:24:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:24:57] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:57] [INFO ] Invariant cache hit.
[2024-05-24 02:24:57] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 82/82 places, 208/208 transitions.
Normalized transition count is 128 out of 208 initially.
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:57] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=2123 ) properties (out of 1) seen :231
[2024-05-24 02:24:59] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-24 02:24:59] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 02:24:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 02:24:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:59] [INFO ] [Real]Added 18 Read/Feed constraints in 11 ms returned sat
[2024-05-24 02:24:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:24:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:24:59] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:24:59] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:24:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-24 02:24:59] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-24 02:24:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2024-05-24 02:24:59] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 6 ms.
[2024-05-24 02:24:59] [INFO ] Added : 25 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[249]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-24 02:24:59] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:59] [INFO ] Invariant cache hit.
[2024-05-24 02:24:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 02:24:59] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:59] [INFO ] Invariant cache hit.
[2024-05-24 02:24:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:24:59] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-24 02:24:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:24:59] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-24 02:24:59] [INFO ] Invariant cache hit.
[2024-05-24 02:25:00] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 82/82 places, 208/208 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-09 in 7294 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-10
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:00] [INFO ] Computed 2 invariants in 0 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2024-05-24 02:25:00] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:25:00] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:25:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:00] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:25:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:25:00] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:25:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:25:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:00] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-24 02:25:00] [INFO ] [Nat]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:00] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:25:00] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 110 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 110 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 103 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 103 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 103 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 99 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 99 transition count 244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 95 transition count 232
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 95 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 91 transition count 224
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 91 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 87 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 87 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 83 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 83 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 80 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 80 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 77 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 77 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 75 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 75 transition count 192
Applied a total of 95 rules in 17 ms. Remains 75 /122 variables (removed 47) and now considering 192/296 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 75/122 places, 192/296 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:00] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=2288 ) properties (out of 1) seen :809
[2024-05-24 02:25:01] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:01] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:25:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:01] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:25:01] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:01] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:01] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:25:01] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:25:01] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-24 02:25:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-24 02:25:01] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-24 02:25:01] [INFO ] Added : 7 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[809]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:25:02] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:02] [INFO ] Invariant cache hit.
[2024-05-24 02:25:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 02:25:02] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:02] [INFO ] Invariant cache hit.
[2024-05-24 02:25:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:02] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-24 02:25:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:25:02] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:02] [INFO ] Invariant cache hit.
[2024-05-24 02:25:02] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 75/75 places, 192/192 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:02] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=2277 ) properties (out of 1) seen :920
[2024-05-24 02:25:04] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:04] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:25:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 02:25:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:04] [INFO ] [Real]Added 17 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:25:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:04] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:25:04] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:25:04] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-24 02:25:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-24 02:25:04] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:25:04] [INFO ] Added : 7 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[920]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:25:04] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:04] [INFO ] Invariant cache hit.
[2024-05-24 02:25:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 02:25:05] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:05] [INFO ] Invariant cache hit.
[2024-05-24 02:25:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:05] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-24 02:25:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:25:05] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:05] [INFO ] Invariant cache hit.
[2024-05-24 02:25:05] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 75/75 places, 192/192 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:05] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 1) seen :1226
[2024-05-24 02:25:06] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:06] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:25:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:25:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:06] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:25:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:06] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 02:25:06] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:25:06] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-24 02:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-24 02:25:06] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:25:06] [INFO ] Added : 7 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1226]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:25:07] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:07] [INFO ] Invariant cache hit.
[2024-05-24 02:25:07] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 02:25:07] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:07] [INFO ] Invariant cache hit.
[2024-05-24 02:25:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:07] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-24 02:25:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:25:07] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:07] [INFO ] Invariant cache hit.
[2024-05-24 02:25:07] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 75/75 places, 192/192 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:07] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 893 ms. (steps per millisecond=1119 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 1) seen :806
[2024-05-24 02:25:09] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:09] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 02:25:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:25:09] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:09] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:25:09] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:25:09] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:25:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-24 02:25:09] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:25:09] [INFO ] Added : 7 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1226]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:25:10] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:10] [INFO ] Invariant cache hit.
[2024-05-24 02:25:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-24 02:25:10] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:10] [INFO ] Invariant cache hit.
[2024-05-24 02:25:10] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:10] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-24 02:25:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:25:10] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:10] [INFO ] Invariant cache hit.
[2024-05-24 02:25:10] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 75/75 places, 192/192 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-10 in 10618 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-12
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:10] [INFO ] Computed 2 invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2024-05-24 02:25:10] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:25:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:10] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:25:10] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:25:10] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:25:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:25:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:10] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:25:10] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:25:10] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 12 ms.
[2024-05-24 02:25:10] [INFO ] Added : 2 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 113 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 113 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 105 transition count 259
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 105 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 105 transition count 255
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 100 transition count 243
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 100 transition count 243
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 96 transition count 231
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 96 transition count 231
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 92 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 92 transition count 223
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 88 transition count 215
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 88 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 84 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 84 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 81 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 81 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 78 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 78 transition count 195
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 76 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 76 transition count 191
Applied a total of 96 rules in 12 ms. Remains 76 /122 variables (removed 46) and now considering 191/296 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 76/122 places, 191/296 transitions.
Normalized transition count is 117 out of 191 initially.
// Phase 1: matrix 117 rows 76 cols
[2024-05-24 02:25:10] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 1) seen :1
[2024-05-24 02:25:12] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-24 02:25:12] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 02:25:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:12] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:25:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:12] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:25:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:12] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:25:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:25:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:25:12] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-24 02:25:12] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:25:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 169 ms
[2024-05-24 02:25:12] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-24 02:25:12] [INFO ] Added : 4 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-24 02:25:12] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-24 02:25:12] [INFO ] Invariant cache hit.
[2024-05-24 02:25:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 02:25:12] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-24 02:25:12] [INFO ] Invariant cache hit.
[2024-05-24 02:25:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:12] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-24 02:25:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:25:12] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-24 02:25:12] [INFO ] Invariant cache hit.
[2024-05-24 02:25:12] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 76/76 places, 191/191 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-12 in 2052 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-13
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:12] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10002 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :5
[2024-05-24 02:25:12] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 02:25:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:12] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:25:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:25:12] [INFO ] [Real]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:12] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-24 02:25:12] [INFO ] [Nat]Added 43 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:12] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 9 ms.
[2024-05-24 02:25:12] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 110 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 110 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 103 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 103 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 103 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 99 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 99 transition count 244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 95 transition count 232
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 95 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 91 transition count 224
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 91 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 87 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 87 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 83 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 83 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 80 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 80 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 77 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 77 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 75 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 75 transition count 192
Applied a total of 95 rules in 9 ms. Remains 75 /122 variables (removed 47) and now considering 192/296 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 75/122 places, 192/296 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:12] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 1) seen :802
[2024-05-24 02:25:14] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:14] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 02:25:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:14] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 02:25:14] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:14] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:14] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 02:25:14] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:25:14] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:25:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-24 02:25:14] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:25:14] [INFO ] Added : 7 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[802]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:25:15] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:15] [INFO ] Invariant cache hit.
[2024-05-24 02:25:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 02:25:15] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:15] [INFO ] Invariant cache hit.
[2024-05-24 02:25:15] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:15] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-24 02:25:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:25:15] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:15] [INFO ] Invariant cache hit.
[2024-05-24 02:25:15] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 75/75 places, 192/192 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:15] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 1) seen :836
[2024-05-24 02:25:16] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:16] [INFO ] Computed 3 invariants in 4 ms
[2024-05-24 02:25:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:16] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 02:25:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:16] [INFO ] [Real]Added 17 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:25:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:16] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 02:25:16] [INFO ] [Nat]Added 17 Read/Feed constraints in 1 ms returned sat
[2024-05-24 02:25:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:25:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-24 02:25:16] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 9 ms.
[2024-05-24 02:25:16] [INFO ] Added : 7 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[836]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:25:17] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:17] [INFO ] Invariant cache hit.
[2024-05-24 02:25:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-24 02:25:17] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:17] [INFO ] Invariant cache hit.
[2024-05-24 02:25:17] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:17] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-24 02:25:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:25:17] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:17] [INFO ] Invariant cache hit.
[2024-05-24 02:25:17] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 75/75 places, 192/192 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:17] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 1) seen :612
[2024-05-24 02:25:18] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-24 02:25:18] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 02:25:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:19] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:25:19] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:19] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-24 02:25:19] [INFO ] [Nat]Added 17 Read/Feed constraints in 6 ms returned sat
[2024-05-24 02:25:19] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-24 02:25:19] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-24 02:25:19] [INFO ] Added : 7 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[836]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-24 02:25:19] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:19] [INFO ] Invariant cache hit.
[2024-05-24 02:25:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 02:25:19] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:19] [INFO ] Invariant cache hit.
[2024-05-24 02:25:19] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 02:25:19] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-24 02:25:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:25:19] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-24 02:25:19] [INFO ] Invariant cache hit.
[2024-05-24 02:25:20] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 75/75 places, 192/192 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-13 in 7324 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-14
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:20] [INFO ] Computed 2 invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
[2024-05-24 02:25:20] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:25:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:20] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 02:25:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:25:20] [INFO ] [Real]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:25:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:20] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 02:25:20] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:25:20] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 11 ms.
[2024-05-24 02:25:20] [INFO ] Added : 11 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 110 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 110 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 103 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 103 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 103 transition count 252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 99 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 99 transition count 244
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 96 transition count 234
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 96 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 93 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 93 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 90 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 90 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 87 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 87 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 85 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 85 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 83 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 83 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 81 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 81 transition count 204
Applied a total of 85 rules in 11 ms. Remains 81 /122 variables (removed 41) and now considering 204/296 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 81/122 places, 204/296 transitions.
Normalized transition count is 125 out of 204 initially.
// Phase 1: matrix 125 rows 81 cols
[2024-05-24 02:25:20] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 1) seen :643
[2024-05-24 02:25:21] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
// Phase 1: matrix 125 rows 81 cols
[2024-05-24 02:25:21] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 02:25:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:21] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:25:21] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:21] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:21] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 02:25:21] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:25:21] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 02:25:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-24 02:25:21] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 6 ms.
[2024-05-24 02:25:21] [INFO ] Added : 17 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[643]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-24 02:25:22] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-24 02:25:22] [INFO ] Invariant cache hit.
[2024-05-24 02:25:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-24 02:25:22] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-24 02:25:22] [INFO ] Invariant cache hit.
[2024-05-24 02:25:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:22] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-24 02:25:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:25:22] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-24 02:25:22] [INFO ] Invariant cache hit.
[2024-05-24 02:25:23] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 81/81 places, 204/204 transitions.
Normalized transition count is 125 out of 204 initially.
// Phase 1: matrix 125 rows 81 cols
[2024-05-24 02:25:23] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 1) seen :607
[2024-05-24 02:25:24] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
// Phase 1: matrix 125 rows 81 cols
[2024-05-24 02:25:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 02:25:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:25:24] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:24] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:24] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:25:24] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:25:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 02:25:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-24 02:25:24] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 8 ms.
[2024-05-24 02:25:24] [INFO ] Added : 17 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[643]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-24 02:25:25] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-24 02:25:25] [INFO ] Invariant cache hit.
[2024-05-24 02:25:25] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-24 02:25:25] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-24 02:25:25] [INFO ] Invariant cache hit.
[2024-05-24 02:25:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:25] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-24 02:25:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:25:25] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-24 02:25:25] [INFO ] Invariant cache hit.
[2024-05-24 02:25:25] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 81/81 places, 204/204 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-14 in 5716 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-15
Normalized transition count is 200 out of 296 initially.
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:25] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :5
[2024-05-24 02:25:25] [INFO ] Flow matrix only has 200 transitions (discarded 96 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-24 02:25:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 02:25:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 02:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:25] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-24 02:25:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 02:25:25] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-24 02:25:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 02:25:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 02:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:25] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 02:25:25] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-24 02:25:25] [INFO ] Computed and/alt/rep : 47/131/43 causal constraints (skipped 155 transitions) in 12 ms.
[2024-05-24 02:25:25] [INFO ] Added : 13 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[11]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 296/296 transitions.
Graph (complete) has 497 edges and 122 vertex of which 110 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 110 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 103 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 103 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 103 transition count 252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 99 transition count 242
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 99 transition count 242
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 96 transition count 232
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 96 transition count 232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 93 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 93 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 90 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 90 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 87 transition count 214
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 87 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 84 transition count 208
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 84 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 81 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 81 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 79 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 79 transition count 198
Applied a total of 89 rules in 11 ms. Remains 79 /122 variables (removed 43) and now considering 198/296 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 79/122 places, 198/296 transitions.
Normalized transition count is 122 out of 198 initially.
// Phase 1: matrix 122 rows 79 cols
[2024-05-24 02:25:26] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 1) seen :665
[2024-05-24 02:25:27] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
// Phase 1: matrix 122 rows 79 cols
[2024-05-24 02:25:27] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 02:25:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 02:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:27] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:25:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:27] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:27] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 02:25:27] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:25:27] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:25:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-24 02:25:27] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 67 transitions) in 6 ms.
[2024-05-24 02:25:27] [INFO ] Added : 13 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[665]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 02:25:28] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2024-05-24 02:25:28] [INFO ] Invariant cache hit.
[2024-05-24 02:25:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 02:25:28] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2024-05-24 02:25:28] [INFO ] Invariant cache hit.
[2024-05-24 02:25:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:28] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-24 02:25:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:25:28] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2024-05-24 02:25:28] [INFO ] Invariant cache hit.
[2024-05-24 02:25:28] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 79/79 places, 198/198 transitions.
Normalized transition count is 122 out of 198 initially.
// Phase 1: matrix 122 rows 79 cols
[2024-05-24 02:25:28] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 1) seen :664
[2024-05-24 02:25:29] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
// Phase 1: matrix 122 rows 79 cols
[2024-05-24 02:25:29] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 02:25:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 02:25:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:30] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-24 02:25:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:25:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 02:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 02:25:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 02:25:30] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-24 02:25:30] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-24 02:25:30] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 67 transitions) in 6 ms.
[2024-05-24 02:25:30] [INFO ] Added : 13 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[665]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 02:25:30] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2024-05-24 02:25:30] [INFO ] Invariant cache hit.
[2024-05-24 02:25:31] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-24 02:25:31] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2024-05-24 02:25:31] [INFO ] Invariant cache hit.
[2024-05-24 02:25:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 02:25:31] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-24 02:25:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:25:31] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2024-05-24 02:25:31] [INFO ] Invariant cache hit.
[2024-05-24 02:25:31] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 79/79 places, 198/198 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-15 in 5486 ms.
[2024-05-24 02:25:31] [INFO ] Flatten gal took : 50 ms
[2024-05-24 02:25:31] [INFO ] Applying decomposition
[2024-05-24 02:25:31] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5478054406381781493.txt' '-o' '/tmp/graph5478054406381781493.bin' '-w' '/tmp/graph5478054406381781493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5478054406381781493.bin' '-l' '-1' '-v' '-w' '/tmp/graph5478054406381781493.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:25:31] [INFO ] Decomposing Gal with order
[2024-05-24 02:25:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:25:31] [INFO ] Removed a total of 500 redundant transitions.
[2024-05-24 02:25:31] [INFO ] Flatten gal took : 49 ms
[2024-05-24 02:25:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 11 ms.
[2024-05-24 02:25:31] [INFO ] Time to serialize gal into /tmp/UpperBounds14736878662977584971.gal : 5 ms
[2024-05-24 02:25:31] [INFO ] Time to serialize properties into /tmp/UpperBounds12730971405487186791.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14736878662977584971.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12730971405487186791.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds12730971405487186791.prop.
Detected timeout of ITS tools.
[2024-05-24 02:46:17] [INFO ] Flatten gal took : 91 ms
[2024-05-24 02:46:17] [INFO ] Time to serialize gal into /tmp/UpperBounds5868561988480807895.gal : 34 ms
[2024-05-24 02:46:17] [INFO ] Time to serialize properties into /tmp/UpperBounds8170215561063060162.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5868561988480807895.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8170215561063060162.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds8170215561063060162.prop.
Detected timeout of ITS tools.
[2024-05-24 03:07:06] [INFO ] Flatten gal took : 4623 ms
[2024-05-24 03:07:07] [INFO ] Input system was already deterministic with 296 transitions.
[2024-05-24 03:07:07] [INFO ] Transformed 122 places.
[2024-05-24 03:07:07] [INFO ] Transformed 296 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 03:07:07] [INFO ] Time to serialize gal into /tmp/UpperBounds17229824125159359769.gal : 6 ms
[2024-05-24 03:07:07] [INFO ] Time to serialize properties into /tmp/UpperBounds7869069054291280342.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17229824125159359769.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7869069054291280342.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7869069054291280342.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 743580 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16231068 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-b008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is FunctionPointer-PT-b008, 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 r197-tall-171640625000146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b008.tgz
mv FunctionPointer-PT-b008 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 ;