About the Execution of 2021-gold for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13659.195 | 3600000.00 | 3679918.00 | 9915.10 | ? ? 0 0 ? 0 0 ? 0 ? ? 16 16 ? 16 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292800187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is FunctionPointer-PT-c016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292800187
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.8K Jun 7 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 7 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Jun 7 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 7 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 17:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M Jun 6 12:11 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654768283069
Running Version 0
[2022-06-09 09:51:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 09:51:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 09:51:25] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2022-06-09 09:51:25] [INFO ] Transformed 2826 places.
[2022-06-09 09:51:25] [INFO ] Transformed 8960 transitions.
[2022-06-09 09:51:25] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 456 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1198 places in 34 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3540 out of 5962 initially.
// Phase 1: matrix 3540 rows 1628 cols
[2022-06-09 09:51:25] [INFO ] Computed 4 place invariants in 112 ms
Incomplete random walk after 10015 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 11) seen :12
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :4
[2022-06-09 09:51:25] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2022-06-09 09:51:26] [INFO ] Computed 4 place invariants in 66 ms
[2022-06-09 09:51:26] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2022-06-09 09:51:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:51:27] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2022-06-09 09:51:27] [INFO ] State equation strengthened by 2822 read => feed constraints.
[2022-06-09 09:51:29] [INFO ] [Real]Added 2822 Read/Feed constraints in 2010 ms returned sat
[2022-06-09 09:51:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:51:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2022-06-09 09:51:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:51:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:51:30] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2022-06-09 09:51:32] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2004 ms returned sat
[2022-06-09 09:51:33] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 806 ms.
[2022-06-09 09:51:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:51:35] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:51:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:51:35] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2022-06-09 09:51:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:51:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:51:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:51:36] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2022-06-09 09:51:40] [INFO ] [Nat]Added 2822 Read/Feed constraints in 3950 ms returned sat
[2022-06-09 09:51:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:51:41] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:51:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:51:41] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-06-09 09:51:44] [INFO ] [Real]Added 2822 Read/Feed constraints in 2098 ms returned sat
[2022-06-09 09:51:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:51:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:51:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:51:45] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2022-06-09 09:51:47] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2404 ms returned sat
[2022-06-09 09:51:48] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 493 ms.
[2022-06-09 09:51:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:51:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:51:50] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-06-09 09:51:52] [INFO ] [Real]Added 2822 Read/Feed constraints in 2089 ms returned sat
[2022-06-09 09:51:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:51:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:51:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:51:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:51:53] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2022-06-09 09:51:55] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2120 ms returned sat
[2022-06-09 09:51:56] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 537 ms.
[2022-06-09 09:51:58] [INFO ] Deduced a trap composed of 17 places in 1256 ms of which 9 ms to minimize.
[2022-06-09 09:51:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:51:59] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 09:51:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:51:59] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-06-09 09:52:02] [INFO ] [Real]Added 2822 Read/Feed constraints in 2050 ms returned sat
[2022-06-09 09:52:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:52:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 09:52:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:52:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:03] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2022-06-09 09:52:05] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2264 ms returned sat
[2022-06-09 09:52:06] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 700 ms.
[2022-06-09 09:52:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:52:07] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 09:52:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2022-06-09 09:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:08] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2022-06-09 09:52:10] [INFO ] [Real]Added 2822 Read/Feed constraints in 2037 ms returned sat
[2022-06-09 09:52:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:52:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:52:10] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:11] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2022-06-09 09:52:13] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2100 ms returned sat
[2022-06-09 09:52:14] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 497 ms.
[2022-06-09 09:52:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:52:15] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:52:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:16] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2022-06-09 09:52:18] [INFO ] [Real]Added 2822 Read/Feed constraints in 1986 ms returned sat
[2022-06-09 09:52:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:52:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:52:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:19] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2022-06-09 09:52:21] [INFO ] [Nat]Added 2822 Read/Feed constraints in 1878 ms returned sat
[2022-06-09 09:52:22] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 467 ms.
[2022-06-09 09:52:24] [INFO ] Deduced a trap composed of 17 places in 1138 ms of which 12 ms to minimize.
[2022-06-09 09:52:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:52:25] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:52:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 09:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:25] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2022-06-09 09:52:27] [INFO ] [Real]Added 2822 Read/Feed constraints in 1990 ms returned sat
[2022-06-09 09:52:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:52:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:52:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:28] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2022-06-09 09:52:30] [INFO ] [Nat]Added 2822 Read/Feed constraints in 1977 ms returned sat
[2022-06-09 09:52:31] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 408 ms.
[2022-06-09 09:52:34] [INFO ] Deduced a trap composed of 17 places in 1180 ms of which 3 ms to minimize.
[2022-06-09 09:52:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:52:34] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:52:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 09:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:35] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2022-06-09 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:52:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:52:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:36] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2022-06-09 09:52:39] [INFO ] [Nat]Added 2822 Read/Feed constraints in 3739 ms returned sat
[2022-06-09 09:52:40] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 427 ms.
[2022-06-09 09:52:40] [INFO ] Added : 0 causal constraints over 0 iterations in 428 ms. Result :unknown
[2022-06-09 09:52:40] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:52:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 09:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:41] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2022-06-09 09:52:43] [INFO ] [Real]Added 2822 Read/Feed constraints in 2069 ms returned sat
[2022-06-09 09:52:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:52:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:52:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 6 ms returned sat
[2022-06-09 09:52:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:44] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2022-06-09 09:52:46] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2040 ms returned sat
[2022-06-09 09:52:47] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 450 ms.
[2022-06-09 09:52:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:52:48] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:52:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 09:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:49] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2022-06-09 09:52:51] [INFO ] [Real]Added 2822 Read/Feed constraints in 2042 ms returned sat
[2022-06-09 09:52:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:52:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:52:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:52:52] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2022-06-09 09:52:55] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2086 ms returned sat
[2022-06-09 09:52:55] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 403 ms.
[2022-06-09 09:52:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 16, -1, -1, 16, 16, -1, 16, 16] Max seen :[1, 0, 1, 1, 1, 10, 1, 5, 0, 2, 1]
Incomplete Parikh walk after 1379000 steps, including 1000 resets, run finished after 27584 ms. (steps per millisecond=49 ) properties (out of 11) seen :42 could not realise parikh vector
Support contains 11 out of 1628 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1419 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.26 ms
Discarding 209 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 1419 transition count 5578
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 683 place count 1121 transition count 3286
Iterating global reduction 1 with 298 rules applied. Total rules applied 981 place count 1121 transition count 3286
Ensure Unique test removed 344 transitions
Reduce isomorphic transitions removed 344 transitions.
Iterating post reduction 1 with 344 rules applied. Total rules applied 1325 place count 1121 transition count 2942
Discarding 157 places :
Symmetric choice reduction at 2 with 157 rule applications. Total rules 1482 place count 964 transition count 2628
Iterating global reduction 2 with 157 rules applied. Total rules applied 1639 place count 964 transition count 2628
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1703 place count 964 transition count 2564
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1716 place count 951 transition count 2538
Iterating global reduction 3 with 13 rules applied. Total rules applied 1729 place count 951 transition count 2538
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1742 place count 938 transition count 2512
Iterating global reduction 3 with 13 rules applied. Total rules applied 1755 place count 938 transition count 2512
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1768 place count 925 transition count 2486
Iterating global reduction 3 with 13 rules applied. Total rules applied 1781 place count 925 transition count 2486
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1794 place count 912 transition count 2460
Iterating global reduction 3 with 13 rules applied. Total rules applied 1807 place count 912 transition count 2460
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1820 place count 899 transition count 2434
Iterating global reduction 3 with 13 rules applied. Total rules applied 1833 place count 899 transition count 2434
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1845 place count 887 transition count 2410
Iterating global reduction 3 with 12 rules applied. Total rules applied 1857 place count 887 transition count 2410
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1868 place count 876 transition count 2388
Iterating global reduction 3 with 11 rules applied. Total rules applied 1879 place count 876 transition count 2388
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1932 place count 823 transition count 2186
Iterating global reduction 3 with 53 rules applied. Total rules applied 1985 place count 823 transition count 2186
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2042 place count 766 transition count 1958
Iterating global reduction 3 with 57 rules applied. Total rules applied 2099 place count 766 transition count 1958
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2156 place count 709 transition count 1826
Iterating global reduction 3 with 57 rules applied. Total rules applied 2213 place count 709 transition count 1826
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2270 place count 652 transition count 1712
Iterating global reduction 3 with 57 rules applied. Total rules applied 2327 place count 652 transition count 1712
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2384 place count 595 transition count 1598
Iterating global reduction 3 with 57 rules applied. Total rules applied 2441 place count 595 transition count 1598
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2498 place count 538 transition count 1484
Iterating global reduction 3 with 57 rules applied. Total rules applied 2555 place count 538 transition count 1484
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2610 place count 483 transition count 1374
Iterating global reduction 3 with 55 rules applied. Total rules applied 2665 place count 483 transition count 1374
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2674 place count 474 transition count 1356
Iterating global reduction 3 with 9 rules applied. Total rules applied 2683 place count 474 transition count 1356
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 2697 place count 474 transition count 1342
Applied a total of 2697 rules in 1533 ms. Remains 474 /1628 variables (removed 1154) and now considering 1342/5962 (removed 4620) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/1628 places, 1342/5962 transitions.
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:53:26] [INFO ] Computed 3 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2464 ms. (steps per millisecond=405 ) properties (out of 11) seen :30
FORMULA FunctionPointer-PT-c016-UpperBounds-12 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 841 ms. (steps per millisecond=1189 ) properties (out of 10) seen :179
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 10) seen :134
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 10) seen :102
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 10) seen :85
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 10) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 832 ms. (steps per millisecond=1201 ) properties (out of 10) seen :24
[2022-06-09 09:53:36] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:53:36] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:53:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:37] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:53:37] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:53:37] [INFO ] [Real]Added 417 Read/Feed constraints in 236 ms returned sat
[2022-06-09 09:53:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:37] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-06-09 09:53:37] [INFO ] [Nat]Added 417 Read/Feed constraints in 281 ms returned sat
[2022-06-09 09:53:38] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:53:38] [INFO ] Added : 20 causal constraints over 4 iterations in 331 ms. Result :sat
Minimization took 1079 ms.
[2022-06-09 09:53:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:39] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-06-09 09:53:39] [INFO ] [Real]Added 417 Read/Feed constraints in 230 ms returned sat
[2022-06-09 09:53:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:40] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2022-06-09 09:53:40] [INFO ] [Nat]Added 417 Read/Feed constraints in 283 ms returned sat
[2022-06-09 09:53:40] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 79 ms.
[2022-06-09 09:53:40] [INFO ] Added : 20 causal constraints over 4 iterations in 305 ms. Result :sat
Minimization took 767 ms.
[2022-06-09 09:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:41] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-09 09:53:42] [INFO ] [Real]Added 417 Read/Feed constraints in 228 ms returned sat
[2022-06-09 09:53:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:42] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2022-06-09 09:53:42] [INFO ] [Nat]Added 417 Read/Feed constraints in 280 ms returned sat
[2022-06-09 09:53:42] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 80 ms.
[2022-06-09 09:53:42] [INFO ] Added : 20 causal constraints over 4 iterations in 313 ms. Result :sat
Minimization took 918 ms.
[2022-06-09 09:53:43] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:44] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-06-09 09:53:44] [INFO ] [Real]Added 417 Read/Feed constraints in 214 ms returned sat
[2022-06-09 09:53:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:53:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:44] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-06-09 09:53:44] [INFO ] [Nat]Added 417 Read/Feed constraints in 294 ms returned sat
[2022-06-09 09:53:45] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 67 ms.
[2022-06-09 09:53:45] [INFO ] Added : 21 causal constraints over 5 iterations in 353 ms. Result :sat
Minimization took 946 ms.
[2022-06-09 09:53:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:46] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-06-09 09:53:46] [INFO ] [Real]Added 417 Read/Feed constraints in 229 ms returned sat
[2022-06-09 09:53:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:47] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:53:47] [INFO ] [Nat]Added 417 Read/Feed constraints in 286 ms returned sat
[2022-06-09 09:53:47] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:53:47] [INFO ] Added : 20 causal constraints over 4 iterations in 296 ms. Result :sat
Minimization took 741 ms.
[2022-06-09 09:53:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:48] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-09 09:53:48] [INFO ] [Real]Added 417 Read/Feed constraints in 232 ms returned sat
[2022-06-09 09:53:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:49] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2022-06-09 09:53:49] [INFO ] [Nat]Added 417 Read/Feed constraints in 272 ms returned sat
[2022-06-09 09:53:49] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 1 ms to minimize.
[2022-06-09 09:53:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-06-09 09:53:49] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 86 ms.
[2022-06-09 09:53:49] [INFO ] Added : 20 causal constraints over 4 iterations in 326 ms. Result :sat
Minimization took 774 ms.
[2022-06-09 09:53:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:50] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-06-09 09:53:51] [INFO ] [Real]Added 417 Read/Feed constraints in 226 ms returned sat
[2022-06-09 09:53:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:51] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2022-06-09 09:53:51] [INFO ] [Nat]Added 417 Read/Feed constraints in 203 ms returned sat
[2022-06-09 09:53:51] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 108 ms.
[2022-06-09 09:53:52] [INFO ] Added : 21 causal constraints over 5 iterations in 347 ms. Result :sat
Minimization took 955 ms.
[2022-06-09 09:53:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:53] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-06-09 09:53:53] [INFO ] [Real]Added 417 Read/Feed constraints in 230 ms returned sat
[2022-06-09 09:53:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:53] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-06-09 09:53:53] [INFO ] [Nat]Added 417 Read/Feed constraints in 283 ms returned sat
[2022-06-09 09:53:54] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 1 ms to minimize.
[2022-06-09 09:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-06-09 09:53:54] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 71 ms.
[2022-06-09 09:53:54] [INFO ] Added : 20 causal constraints over 4 iterations in 300 ms. Result :sat
Minimization took 741 ms.
[2022-06-09 09:53:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:55] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-06-09 09:53:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:55] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2022-06-09 09:53:56] [INFO ] [Nat]Added 417 Read/Feed constraints in 309 ms returned sat
[2022-06-09 09:53:56] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 71 ms.
[2022-06-09 09:53:56] [INFO ] Added : 20 causal constraints over 4 iterations in 277 ms. Result :sat
Minimization took 873 ms.
[2022-06-09 09:53:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:57] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2022-06-09 09:53:57] [INFO ] [Real]Added 417 Read/Feed constraints in 220 ms returned sat
[2022-06-09 09:53:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:53:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:53:57] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2022-06-09 09:53:58] [INFO ] [Nat]Added 417 Read/Feed constraints in 287 ms returned sat
[2022-06-09 09:53:58] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 99 ms.
[2022-06-09 09:53:58] [INFO ] Added : 21 causal constraints over 5 iterations in 337 ms. Result :sat
Minimization took 795 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 16, -1, -1, 16, -1, 16, 16] Max seen :[161, 5, 114, 2, 5, 80, 1, 69, 7, 3]
Incomplete Parikh walk after 61100 steps, including 763 resets, run finished after 225 ms. (steps per millisecond=271 ) properties (out of 10) seen :34 could not realise parikh vector
Incomplete Parikh walk after 52800 steps, including 776 resets, run finished after 100 ms. (steps per millisecond=528 ) properties (out of 10) seen :17 could not realise parikh vector
FORMULA FunctionPointer-PT-c016-UpperBounds-14 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 123300 steps, including 997 resets, run finished after 507 ms. (steps per millisecond=243 ) properties (out of 9) seen :22 could not realise parikh vector
Incomplete Parikh walk after 58000 steps, including 815 resets, run finished after 171 ms. (steps per millisecond=339 ) properties (out of 9) seen :21 could not realise parikh vector
FORMULA FunctionPointer-PT-c016-UpperBounds-11 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 179900 steps, including 1000 resets, run finished after 747 ms. (steps per millisecond=240 ) properties (out of 8) seen :25 could not realise parikh vector
Incomplete Parikh walk after 61800 steps, including 580 resets, run finished after 210 ms. (steps per millisecond=294 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 61900 steps, including 691 resets, run finished after 202 ms. (steps per millisecond=306 ) properties (out of 8) seen :9 could not realise parikh vector
Incomplete Parikh walk after 184000 steps, including 1000 resets, run finished after 769 ms. (steps per millisecond=239 ) properties (out of 8) seen :20 could not realise parikh vector
Incomplete Parikh walk after 61900 steps, including 592 resets, run finished after 208 ms. (steps per millisecond=297 ) properties (out of 8) seen :6 could not realise parikh vector
Incomplete Parikh walk after 211400 steps, including 1000 resets, run finished after 969 ms. (steps per millisecond=218 ) properties (out of 8) seen :35 could not realise parikh vector
Support contains 8 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Applied a total of 0 rules in 56 ms. Remains 474 /474 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1342/1342 transitions.
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:54:03] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2432 ms. (steps per millisecond=411 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 8) seen :129
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 841 ms. (steps per millisecond=1189 ) properties (out of 8) seen :19
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 8) seen :117
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 8) seen :99
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 8) seen :98
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 8) seen :23
[2022-06-09 09:54:12] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:54:12] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-09 09:54:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:12] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-06-09 09:54:13] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:54:13] [INFO ] [Real]Added 417 Read/Feed constraints in 205 ms returned sat
[2022-06-09 09:54:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:13] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-06-09 09:54:13] [INFO ] [Nat]Added 417 Read/Feed constraints in 323 ms returned sat
[2022-06-09 09:54:13] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:54:14] [INFO ] Added : 20 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 802 ms.
[2022-06-09 09:54:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:15] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-06-09 09:54:15] [INFO ] [Real]Added 417 Read/Feed constraints in 231 ms returned sat
[2022-06-09 09:54:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:15] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:54:15] [INFO ] [Nat]Added 417 Read/Feed constraints in 287 ms returned sat
[2022-06-09 09:54:15] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 68 ms.
[2022-06-09 09:54:16] [INFO ] Added : 20 causal constraints over 4 iterations in 293 ms. Result :sat
Minimization took 770 ms.
[2022-06-09 09:54:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:17] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-06-09 09:54:17] [INFO ] [Real]Added 417 Read/Feed constraints in 233 ms returned sat
[2022-06-09 09:54:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:17] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:54:17] [INFO ] [Nat]Added 417 Read/Feed constraints in 268 ms returned sat
[2022-06-09 09:54:18] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:54:18] [INFO ] Added : 20 causal constraints over 4 iterations in 293 ms. Result :sat
Minimization took 704 ms.
[2022-06-09 09:54:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:19] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-06-09 09:54:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:19] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-06-09 09:54:19] [INFO ] [Nat]Added 417 Read/Feed constraints in 302 ms returned sat
[2022-06-09 09:54:20] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 1 ms to minimize.
[2022-06-09 09:54:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-06-09 09:54:20] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 67 ms.
[2022-06-09 09:54:20] [INFO ] Added : 21 causal constraints over 5 iterations in 360 ms. Result :sat
Minimization took 798 ms.
[2022-06-09 09:54:21] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:21] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:54:21] [INFO ] [Real]Added 417 Read/Feed constraints in 231 ms returned sat
[2022-06-09 09:54:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:21] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:54:22] [INFO ] [Nat]Added 417 Read/Feed constraints in 293 ms returned sat
[2022-06-09 09:54:22] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 68 ms.
[2022-06-09 09:54:22] [INFO ] Added : 20 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 853 ms.
[2022-06-09 09:54:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:23] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-06-09 09:54:23] [INFO ] [Real]Added 417 Read/Feed constraints in 228 ms returned sat
[2022-06-09 09:54:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:24] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-06-09 09:54:24] [INFO ] [Nat]Added 417 Read/Feed constraints in 272 ms returned sat
[2022-06-09 09:54:24] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 1 ms to minimize.
[2022-06-09 09:54:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-06-09 09:54:24] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:54:24] [INFO ] Added : 20 causal constraints over 4 iterations in 289 ms. Result :sat
Minimization took 733 ms.
[2022-06-09 09:54:25] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:25] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:54:26] [INFO ] [Real]Added 417 Read/Feed constraints in 235 ms returned sat
[2022-06-09 09:54:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:26] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2022-06-09 09:54:26] [INFO ] [Nat]Added 417 Read/Feed constraints in 277 ms returned sat
[2022-06-09 09:54:26] [INFO ] Deduced a trap composed of 135 places in 118 ms of which 1 ms to minimize.
[2022-06-09 09:54:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-06-09 09:54:26] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 70 ms.
[2022-06-09 09:54:27] [INFO ] Added : 20 causal constraints over 4 iterations in 295 ms. Result :sat
Minimization took 806 ms.
[2022-06-09 09:54:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:28] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-06-09 09:54:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:54:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:28] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2022-06-09 09:54:28] [INFO ] [Nat]Added 417 Read/Feed constraints in 317 ms returned sat
[2022-06-09 09:54:28] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 0 ms to minimize.
[2022-06-09 09:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-06-09 09:54:29] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 122 ms.
[2022-06-09 09:54:29] [INFO ] Added : 21 causal constraints over 5 iterations in 357 ms. Result :sat
Minimization took 811 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 16, -1, -1, -1, 16] Max seen :[161, 5, 122, 15, 97, 83, 82, 15]
Incomplete Parikh walk after 57600 steps, including 625 resets, run finished after 182 ms. (steps per millisecond=316 ) properties (out of 8) seen :14 could not realise parikh vector
Incomplete Parikh walk after 139800 steps, including 996 resets, run finished after 519 ms. (steps per millisecond=269 ) properties (out of 8) seen :15 could not realise parikh vector
Incomplete Parikh walk after 185300 steps, including 1000 resets, run finished after 764 ms. (steps per millisecond=242 ) properties (out of 8) seen :32 could not realise parikh vector
Incomplete Parikh walk after 82200 steps, including 718 resets, run finished after 280 ms. (steps per millisecond=293 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 62400 steps, including 535 resets, run finished after 210 ms. (steps per millisecond=297 ) properties (out of 8) seen :14 could not realise parikh vector
Incomplete Parikh walk after 194400 steps, including 1000 resets, run finished after 828 ms. (steps per millisecond=234 ) properties (out of 8) seen :41 could not realise parikh vector
Incomplete Parikh walk after 61900 steps, including 587 resets, run finished after 213 ms. (steps per millisecond=290 ) properties (out of 8) seen :5 could not realise parikh vector
Incomplete Parikh walk after 211400 steps, including 1000 resets, run finished after 908 ms. (steps per millisecond=232 ) properties (out of 8) seen :29 could not realise parikh vector
Support contains 8 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Applied a total of 0 rules in 56 ms. Remains 474 /474 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1342/1342 transitions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Applied a total of 0 rules in 56 ms. Remains 474 /474 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
[2022-06-09 09:54:34] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:54:34] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 09:54:34] [INFO ] Implicit Places using invariants in 342 ms returned []
[2022-06-09 09:54:34] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:54:34] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:54:34] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:54:41] [INFO ] Implicit Places using invariants and state equation in 7237 ms returned []
Implicit Place search using SMT with State Equation took 7580 ms to find 0 implicit places.
[2022-06-09 09:54:41] [INFO ] Redundant transitions in 99 ms returned []
[2022-06-09 09:54:41] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:54:41] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:54:42] [INFO ] Dead Transitions using invariants and state equation in 443 ms returned []
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1342/1342 transitions.
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:54:42] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 2498 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 8) seen :150
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 828 ms. (steps per millisecond=1207 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 831 ms. (steps per millisecond=1203 ) properties (out of 8) seen :123
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 8) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 8) seen :79
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 8) seen :94
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 8) seen :106
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 8) seen :21
[2022-06-09 09:54:51] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:54:51] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-09 09:54:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:51] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-06-09 09:54:51] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:54:51] [INFO ] [Real]Added 417 Read/Feed constraints in 235 ms returned sat
[2022-06-09 09:54:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:52] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2022-06-09 09:54:52] [INFO ] [Nat]Added 417 Read/Feed constraints in 282 ms returned sat
[2022-06-09 09:54:52] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 105 ms.
[2022-06-09 09:54:52] [INFO ] Added : 20 causal constraints over 4 iterations in 317 ms. Result :sat
Minimization took 807 ms.
[2022-06-09 09:54:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:53] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-06-09 09:54:54] [INFO ] [Real]Added 417 Read/Feed constraints in 247 ms returned sat
[2022-06-09 09:54:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:54] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:54:54] [INFO ] [Nat]Added 417 Read/Feed constraints in 287 ms returned sat
[2022-06-09 09:54:54] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 70 ms.
[2022-06-09 09:54:54] [INFO ] Added : 20 causal constraints over 4 iterations in 296 ms. Result :sat
Minimization took 826 ms.
[2022-06-09 09:54:55] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:56] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-06-09 09:54:56] [INFO ] [Real]Added 417 Read/Feed constraints in 238 ms returned sat
[2022-06-09 09:54:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:56] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:54:56] [INFO ] [Nat]Added 417 Read/Feed constraints in 283 ms returned sat
[2022-06-09 09:54:56] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 73 ms.
[2022-06-09 09:54:57] [INFO ] Added : 20 causal constraints over 4 iterations in 301 ms. Result :sat
Minimization took 697 ms.
[2022-06-09 09:54:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:58] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-06-09 09:54:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:54:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:54:58] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2022-06-09 09:54:58] [INFO ] [Nat]Added 417 Read/Feed constraints in 304 ms returned sat
[2022-06-09 09:54:58] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 1 ms to minimize.
[2022-06-09 09:54:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-06-09 09:54:58] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:54:59] [INFO ] Added : 21 causal constraints over 5 iterations in 298 ms. Result :sat
Minimization took 800 ms.
[2022-06-09 09:55:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:00] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:55:00] [INFO ] [Real]Added 417 Read/Feed constraints in 266 ms returned sat
[2022-06-09 09:55:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:00] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:55:01] [INFO ] [Nat]Added 417 Read/Feed constraints in 293 ms returned sat
[2022-06-09 09:55:01] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 70 ms.
[2022-06-09 09:55:01] [INFO ] Added : 20 causal constraints over 4 iterations in 292 ms. Result :sat
Minimization took 860 ms.
[2022-06-09 09:55:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:02] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:55:02] [INFO ] [Real]Added 417 Read/Feed constraints in 231 ms returned sat
[2022-06-09 09:55:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:02] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:55:03] [INFO ] [Nat]Added 417 Read/Feed constraints in 272 ms returned sat
[2022-06-09 09:55:03] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 0 ms to minimize.
[2022-06-09 09:55:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-06-09 09:55:03] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:55:03] [INFO ] Added : 20 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 733 ms.
[2022-06-09 09:55:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:04] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-06-09 09:55:04] [INFO ] [Real]Added 417 Read/Feed constraints in 232 ms returned sat
[2022-06-09 09:55:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:05] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:55:05] [INFO ] [Nat]Added 417 Read/Feed constraints in 279 ms returned sat
[2022-06-09 09:55:05] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 1 ms to minimize.
[2022-06-09 09:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-06-09 09:55:05] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 68 ms.
[2022-06-09 09:55:05] [INFO ] Added : 20 causal constraints over 4 iterations in 283 ms. Result :sat
Minimization took 759 ms.
[2022-06-09 09:55:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:06] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-06-09 09:55:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:07] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2022-06-09 09:55:07] [INFO ] [Nat]Added 417 Read/Feed constraints in 317 ms returned sat
[2022-06-09 09:55:07] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 0 ms to minimize.
[2022-06-09 09:55:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-06-09 09:55:07] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 102 ms.
[2022-06-09 09:55:08] [INFO ] Added : 21 causal constraints over 5 iterations in 342 ms. Result :sat
Minimization took 823 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 16, -1, -1, -1, 16] Max seen :[161, 8, 122, 15, 97, 83, 92, 15]
Incomplete Parikh walk after 57600 steps, including 624 resets, run finished after 182 ms. (steps per millisecond=316 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 152800 steps, including 998 resets, run finished after 570 ms. (steps per millisecond=268 ) properties (out of 8) seen :18 could not realise parikh vector
Incomplete Parikh walk after 185300 steps, including 1000 resets, run finished after 761 ms. (steps per millisecond=243 ) properties (out of 8) seen :20 could not realise parikh vector
Incomplete Parikh walk after 82200 steps, including 695 resets, run finished after 281 ms. (steps per millisecond=292 ) properties (out of 8) seen :5 could not realise parikh vector
Incomplete Parikh walk after 62400 steps, including 537 resets, run finished after 209 ms. (steps per millisecond=298 ) properties (out of 8) seen :12 could not realise parikh vector
Incomplete Parikh walk after 194400 steps, including 1000 resets, run finished after 832 ms. (steps per millisecond=233 ) properties (out of 8) seen :28 could not realise parikh vector
Incomplete Parikh walk after 62200 steps, including 583 resets, run finished after 213 ms. (steps per millisecond=292 ) properties (out of 8) seen :5 could not realise parikh vector
Incomplete Parikh walk after 211400 steps, including 1000 resets, run finished after 903 ms. (steps per millisecond=234 ) properties (out of 8) seen :33 could not realise parikh vector
Support contains 8 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Applied a total of 0 rules in 57 ms. Remains 474 /474 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1342/1342 transitions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Applied a total of 0 rules in 57 ms. Remains 474 /474 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
[2022-06-09 09:55:12] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:55:12] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:55:13] [INFO ] Implicit Places using invariants in 335 ms returned []
[2022-06-09 09:55:13] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:55:13] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:55:13] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:55:16] [INFO ] Implicit Places using invariants and state equation in 3088 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
[2022-06-09 09:55:16] [INFO ] Redundant transitions in 85 ms returned []
[2022-06-09 09:55:16] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:55:16] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:55:16] [INFO ] Dead Transitions using invariants and state equation in 407 ms returned []
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1342/1342 transitions.
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:55:16] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2531 ms. (steps per millisecond=395 ) properties (out of 8) seen :25
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 8) seen :23
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 8) seen :114
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 8) seen :112
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 8) seen :31
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 8) seen :108
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 8) seen :58
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 8) seen :137
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 8) seen :17
[2022-06-09 09:55:25] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:55:25] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-09 09:55:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:26] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-06-09 09:55:26] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:55:26] [INFO ] [Real]Added 417 Read/Feed constraints in 238 ms returned sat
[2022-06-09 09:55:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:26] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:55:27] [INFO ] [Nat]Added 417 Read/Feed constraints in 282 ms returned sat
[2022-06-09 09:55:27] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 109 ms.
[2022-06-09 09:55:27] [INFO ] Added : 20 causal constraints over 4 iterations in 320 ms. Result :sat
Minimization took 814 ms.
[2022-06-09 09:55:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:28] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:55:28] [INFO ] [Real]Added 417 Read/Feed constraints in 232 ms returned sat
[2022-06-09 09:55:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:28] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:55:29] [INFO ] [Nat]Added 417 Read/Feed constraints in 292 ms returned sat
[2022-06-09 09:55:29] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 71 ms.
[2022-06-09 09:55:29] [INFO ] Added : 20 causal constraints over 4 iterations in 281 ms. Result :sat
Minimization took 761 ms.
[2022-06-09 09:55:30] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:30] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-06-09 09:55:30] [INFO ] [Real]Added 417 Read/Feed constraints in 229 ms returned sat
[2022-06-09 09:55:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:30] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-06-09 09:55:31] [INFO ] [Nat]Added 417 Read/Feed constraints in 291 ms returned sat
[2022-06-09 09:55:31] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 70 ms.
[2022-06-09 09:55:31] [INFO ] Added : 20 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 709 ms.
[2022-06-09 09:55:32] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:32] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-06-09 09:55:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:32] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-06-09 09:55:33] [INFO ] [Nat]Added 417 Read/Feed constraints in 300 ms returned sat
[2022-06-09 09:55:33] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 0 ms to minimize.
[2022-06-09 09:55:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-06-09 09:55:33] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 68 ms.
[2022-06-09 09:55:33] [INFO ] Added : 21 causal constraints over 5 iterations in 306 ms. Result :sat
Minimization took 790 ms.
[2022-06-09 09:55:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:34] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:55:34] [INFO ] [Real]Added 417 Read/Feed constraints in 232 ms returned sat
[2022-06-09 09:55:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:35] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:55:35] [INFO ] [Nat]Added 417 Read/Feed constraints in 287 ms returned sat
[2022-06-09 09:55:35] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 113 ms.
[2022-06-09 09:55:35] [INFO ] Added : 20 causal constraints over 4 iterations in 324 ms. Result :sat
Minimization took 845 ms.
[2022-06-09 09:55:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:36] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-06-09 09:55:37] [INFO ] [Real]Added 417 Read/Feed constraints in 236 ms returned sat
[2022-06-09 09:55:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:37] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:55:37] [INFO ] [Nat]Added 417 Read/Feed constraints in 273 ms returned sat
[2022-06-09 09:55:37] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 1 ms to minimize.
[2022-06-09 09:55:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-06-09 09:55:37] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:55:38] [INFO ] Added : 20 causal constraints over 4 iterations in 300 ms. Result :sat
Minimization took 728 ms.
[2022-06-09 09:55:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:39] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:55:39] [INFO ] [Real]Added 417 Read/Feed constraints in 232 ms returned sat
[2022-06-09 09:55:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:39] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-06-09 09:55:39] [INFO ] [Nat]Added 417 Read/Feed constraints in 280 ms returned sat
[2022-06-09 09:55:39] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 1 ms to minimize.
[2022-06-09 09:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-06-09 09:55:40] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:55:40] [INFO ] Added : 20 causal constraints over 4 iterations in 290 ms. Result :sat
Minimization took 833 ms.
[2022-06-09 09:55:41] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:41] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2022-06-09 09:55:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:55:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:55:41] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-06-09 09:55:41] [INFO ] [Nat]Added 417 Read/Feed constraints in 320 ms returned sat
[2022-06-09 09:55:42] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 0 ms to minimize.
[2022-06-09 09:55:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-06-09 09:55:42] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 67 ms.
[2022-06-09 09:55:42] [INFO ] Added : 21 causal constraints over 5 iterations in 327 ms. Result :sat
Minimization took 814 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 16, -1, -1, -1, 16] Max seen :[161, 102, 122, 15, 97, 83, 131, 15]
Incomplete Parikh walk after 57600 steps, including 640 resets, run finished after 181 ms. (steps per millisecond=318 ) properties (out of 8) seen :15 could not realise parikh vector
Incomplete Parikh walk after 203500 steps, including 1000 resets, run finished after 891 ms. (steps per millisecond=228 ) properties (out of 8) seen :31 could not realise parikh vector
Incomplete Parikh walk after 185300 steps, including 1000 resets, run finished after 800 ms. (steps per millisecond=231 ) properties (out of 8) seen :31 could not realise parikh vector
Incomplete Parikh walk after 82200 steps, including 694 resets, run finished after 263 ms. (steps per millisecond=312 ) properties (out of 8) seen :6 could not realise parikh vector
Incomplete Parikh walk after 62400 steps, including 534 resets, run finished after 211 ms. (steps per millisecond=295 ) properties (out of 8) seen :13 could not realise parikh vector
Incomplete Parikh walk after 194400 steps, including 1000 resets, run finished after 843 ms. (steps per millisecond=230 ) properties (out of 8) seen :29 could not realise parikh vector
Incomplete Parikh walk after 84600 steps, including 732 resets, run finished after 276 ms. (steps per millisecond=306 ) properties (out of 8) seen :5 could not realise parikh vector
Incomplete Parikh walk after 211400 steps, including 1000 resets, run finished after 906 ms. (steps per millisecond=233 ) properties (out of 8) seen :21 could not realise parikh vector
Support contains 8 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Applied a total of 0 rules in 58 ms. Remains 474 /474 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1342/1342 transitions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Applied a total of 0 rules in 55 ms. Remains 474 /474 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
[2022-06-09 09:55:47] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:55:47] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:55:48] [INFO ] Implicit Places using invariants in 329 ms returned []
[2022-06-09 09:55:48] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:55:48] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:55:48] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:55:52] [INFO ] Implicit Places using invariants and state equation in 3925 ms returned []
Implicit Place search using SMT with State Equation took 4254 ms to find 0 implicit places.
[2022-06-09 09:55:52] [INFO ] Redundant transitions in 29 ms returned []
[2022-06-09 09:55:52] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:55:52] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:55:52] [INFO ] Dead Transitions using invariants and state equation in 406 ms returned []
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1342/1342 transitions.
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:55:52] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2566 ms. (steps per millisecond=389 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 8) seen :110
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 8) seen :125
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 8) seen :95
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties (out of 8) seen :90
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 832 ms. (steps per millisecond=1201 ) properties (out of 8) seen :82
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 8) seen :20
[2022-06-09 09:56:01] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:56:01] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-09 09:56:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:01] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:56:01] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:56:02] [INFO ] [Real]Added 417 Read/Feed constraints in 231 ms returned sat
[2022-06-09 09:56:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:02] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:56:02] [INFO ] [Nat]Added 417 Read/Feed constraints in 280 ms returned sat
[2022-06-09 09:56:02] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 69 ms.
[2022-06-09 09:56:03] [INFO ] Added : 20 causal constraints over 4 iterations in 279 ms. Result :sat
Minimization took 808 ms.
[2022-06-09 09:56:03] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:04] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:56:04] [INFO ] [Real]Added 417 Read/Feed constraints in 240 ms returned sat
[2022-06-09 09:56:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:04] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-06-09 09:56:04] [INFO ] [Nat]Added 417 Read/Feed constraints in 280 ms returned sat
[2022-06-09 09:56:04] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 92 ms.
[2022-06-09 09:56:05] [INFO ] Added : 20 causal constraints over 4 iterations in 310 ms. Result :sat
Minimization took 732 ms.
[2022-06-09 09:56:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:06] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:56:06] [INFO ] [Real]Added 417 Read/Feed constraints in 227 ms returned sat
[2022-06-09 09:56:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:06] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-06-09 09:56:06] [INFO ] [Nat]Added 417 Read/Feed constraints in 285 ms returned sat
[2022-06-09 09:56:07] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 74 ms.
[2022-06-09 09:56:07] [INFO ] Added : 20 causal constraints over 4 iterations in 305 ms. Result :sat
Minimization took 908 ms.
[2022-06-09 09:56:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:08] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-06-09 09:56:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:56:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:08] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2022-06-09 09:56:09] [INFO ] [Nat]Added 417 Read/Feed constraints in 299 ms returned sat
[2022-06-09 09:56:09] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 1 ms to minimize.
[2022-06-09 09:56:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-06-09 09:56:09] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 73 ms.
[2022-06-09 09:56:09] [INFO ] Added : 21 causal constraints over 5 iterations in 313 ms. Result :sat
Minimization took 1027 ms.
[2022-06-09 09:56:10] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:10] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:56:11] [INFO ] [Real]Added 417 Read/Feed constraints in 232 ms returned sat
[2022-06-09 09:56:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:11] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2022-06-09 09:56:11] [INFO ] [Nat]Added 417 Read/Feed constraints in 293 ms returned sat
[2022-06-09 09:56:11] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 80 ms.
[2022-06-09 09:56:11] [INFO ] Added : 20 causal constraints over 4 iterations in 306 ms. Result :sat
Minimization took 1123 ms.
[2022-06-09 09:56:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:13] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-06-09 09:56:13] [INFO ] [Real]Added 417 Read/Feed constraints in 230 ms returned sat
[2022-06-09 09:56:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:13] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2022-06-09 09:56:14] [INFO ] [Nat]Added 417 Read/Feed constraints in 274 ms returned sat
[2022-06-09 09:56:14] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 0 ms to minimize.
[2022-06-09 09:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-06-09 09:56:14] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 97 ms.
[2022-06-09 09:56:14] [INFO ] Added : 20 causal constraints over 4 iterations in 314 ms. Result :sat
Minimization took 724 ms.
[2022-06-09 09:56:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:15] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2022-06-09 09:56:15] [INFO ] [Real]Added 417 Read/Feed constraints in 226 ms returned sat
[2022-06-09 09:56:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:16] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-06-09 09:56:16] [INFO ] [Nat]Added 417 Read/Feed constraints in 280 ms returned sat
[2022-06-09 09:56:16] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 1 ms to minimize.
[2022-06-09 09:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-06-09 09:56:16] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 70 ms.
[2022-06-09 09:56:16] [INFO ] Added : 20 causal constraints over 4 iterations in 290 ms. Result :sat
Minimization took 846 ms.
[2022-06-09 09:56:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:17] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2022-06-09 09:56:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:18] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2022-06-09 09:56:18] [INFO ] [Nat]Added 417 Read/Feed constraints in 310 ms returned sat
[2022-06-09 09:56:18] [INFO ] Deduced a trap composed of 135 places in 134 ms of which 0 ms to minimize.
[2022-06-09 09:56:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-06-09 09:56:18] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 71 ms.
[2022-06-09 09:56:19] [INFO ] Added : 21 causal constraints over 5 iterations in 292 ms. Result :sat
Minimization took 819 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 16, -1, -1, -1, 16] Max seen :[161, 102, 122, 15, 97, 83, 131, 15]
Incomplete Parikh walk after 57600 steps, including 611 resets, run finished after 193 ms. (steps per millisecond=298 ) properties (out of 8) seen :15 could not realise parikh vector
Incomplete Parikh walk after 203500 steps, including 1000 resets, run finished after 877 ms. (steps per millisecond=232 ) properties (out of 8) seen :32 could not realise parikh vector
Incomplete Parikh walk after 185300 steps, including 1000 resets, run finished after 739 ms. (steps per millisecond=250 ) properties (out of 8) seen :21 could not realise parikh vector
Incomplete Parikh walk after 82200 steps, including 715 resets, run finished after 263 ms. (steps per millisecond=312 ) properties (out of 8) seen :6 could not realise parikh vector
Incomplete Parikh walk after 62400 steps, including 518 resets, run finished after 214 ms. (steps per millisecond=291 ) properties (out of 8) seen :12 could not realise parikh vector
Incomplete Parikh walk after 194400 steps, including 1000 resets, run finished after 841 ms. (steps per millisecond=231 ) properties (out of 8) seen :23 could not realise parikh vector
Incomplete Parikh walk after 84600 steps, including 727 resets, run finished after 275 ms. (steps per millisecond=307 ) properties (out of 8) seen :5 could not realise parikh vector
Incomplete Parikh walk after 211400 steps, including 1000 resets, run finished after 953 ms. (steps per millisecond=221 ) properties (out of 8) seen :32 could not realise parikh vector
Support contains 8 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Applied a total of 0 rules in 52 ms. Remains 474 /474 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1342/1342 transitions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Applied a total of 0 rules in 53 ms. Remains 474 /474 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
[2022-06-09 09:56:24] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:56:24] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 09:56:24] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-06-09 09:56:24] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:56:24] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-09 09:56:24] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:56:29] [INFO ] Implicit Places using invariants and state equation in 5124 ms returned []
Implicit Place search using SMT with State Equation took 5436 ms to find 0 implicit places.
[2022-06-09 09:56:29] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 09:56:29] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:56:29] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:56:30] [INFO ] Dead Transitions using invariants and state equation in 421 ms returned []
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1342/1342 transitions.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-00
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:56:30] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-06-09 09:56:30] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:56:30] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:56:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:30] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:56:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:56:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:30] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-06-09 09:56:30] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:56:31] [INFO ] [Nat]Added 417 Read/Feed constraints in 293 ms returned sat
[2022-06-09 09:56:31] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 68 ms.
[2022-06-09 09:56:31] [INFO ] Added : 20 causal constraints over 4 iterations in 298 ms. Result :sat
Minimization took 773 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 62500 steps, including 628 resets, run finished after 238 ms. (steps per millisecond=262 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 469 transition count 1332
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 469 transition count 1332
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 18 place count 469 transition count 1324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 464 transition count 1314
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 464 transition count 1314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 461 transition count 1308
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 461 transition count 1308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 456 transition count 1290
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 456 transition count 1290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 451 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 451 transition count 1280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 446 transition count 1270
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 446 transition count 1270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 441 transition count 1260
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 441 transition count 1260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 436 transition count 1250
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 436 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 431 transition count 1238
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 431 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 426 transition count 1228
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 421 transition count 1218
Applied a total of 114 rules in 295 ms. Remains 421 /474 variables (removed 53) and now considering 1218/1342 (removed 124) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/474 places, 1218/1342 transitions.
Normalized transition count is 688 out of 1218 initially.
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:32] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2187 ms. (steps per millisecond=457 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 1) seen :505
[2022-06-09 09:56:35] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:35] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:56:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:56:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:35] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-06-09 09:56:35] [INFO ] State equation strengthened by 352 read => feed constraints.
[2022-06-09 09:56:35] [INFO ] [Real]Added 352 Read/Feed constraints in 186 ms returned sat
[2022-06-09 09:56:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:36] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-06-09 09:56:36] [INFO ] [Nat]Added 352 Read/Feed constraints in 189 ms returned sat
[2022-06-09 09:56:36] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 1 ms to minimize.
[2022-06-09 09:56:36] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 0 ms to minimize.
[2022-06-09 09:56:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2022-06-09 09:56:36] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 60 ms.
[2022-06-09 09:56:37] [INFO ] Added : 97 causal constraints over 20 iterations in 937 ms. Result :sat
Minimization took 711 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[505]
Incomplete Parikh walk after 574700 steps, including 1000 resets, run finished after 2578 ms. (steps per millisecond=222 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 66 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2022-06-09 09:56:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:41] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:56:41] [INFO ] Implicit Places using invariants in 277 ms returned []
[2022-06-09 09:56:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:41] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:56:41] [INFO ] State equation strengthened by 352 read => feed constraints.
[2022-06-09 09:56:43] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2022-06-09 09:56:43] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-09 09:56:43] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:43] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:56:43] [INFO ] Dead Transitions using invariants and state equation in 366 ms returned []
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 1218/1218 transitions.
Normalized transition count is 688 out of 1218 initially.
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:43] [INFO ] Computed 3 place invariants in 11 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 2169 ms. (steps per millisecond=461 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 660 ms. (steps per millisecond=1515 ) properties (out of 1) seen :0
[2022-06-09 09:56:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:46] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:56:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:46] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-09 09:56:46] [INFO ] State equation strengthened by 352 read => feed constraints.
[2022-06-09 09:56:46] [INFO ] [Real]Added 352 Read/Feed constraints in 181 ms returned sat
[2022-06-09 09:56:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:47] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-06-09 09:56:47] [INFO ] [Nat]Added 352 Read/Feed constraints in 174 ms returned sat
[2022-06-09 09:56:47] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 0 ms to minimize.
[2022-06-09 09:56:47] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 0 ms to minimize.
[2022-06-09 09:56:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2022-06-09 09:56:47] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 61 ms.
[2022-06-09 09:56:48] [INFO ] Added : 97 causal constraints over 20 iterations in 908 ms. Result :sat
Minimization took 701 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[505]
Incomplete Parikh walk after 574700 steps, including 1000 resets, run finished after 2824 ms. (steps per millisecond=203 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2022-06-09 09:56:52] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:52] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:56:52] [INFO ] Implicit Places using invariants in 301 ms returned []
[2022-06-09 09:56:52] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 09:56:52] [INFO ] State equation strengthened by 352 read => feed constraints.
[2022-06-09 09:56:54] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2022-06-09 09:56:54] [INFO ] Redundant transitions in 15 ms returned []
[2022-06-09 09:56:54] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-09 09:56:54] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:56:54] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 1218/1218 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-00 in 24593 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-01
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:56:54] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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
[2022-06-09 09:56:54] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:56:54] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:56:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:55] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-09 09:56:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:56:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:56:55] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:56:55] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:56:55] [INFO ] [Nat]Added 417 Read/Feed constraints in 283 ms returned sat
[2022-06-09 09:56:55] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 0 ms to minimize.
[2022-06-09 09:56:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-06-09 09:56:55] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 68 ms.
[2022-06-09 09:56:56] [INFO ] Added : 20 causal constraints over 4 iterations in 294 ms. Result :sat
Minimization took 816 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 61700 steps, including 611 resets, run finished after 172 ms. (steps per millisecond=358 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 469 transition count 1332
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 469 transition count 1332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 469 transition count 1326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 464 transition count 1314
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 464 transition count 1314
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 460 transition count 1306
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 460 transition count 1306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 454 transition count 1286
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 454 transition count 1286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 448 transition count 1274
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 448 transition count 1274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 442 transition count 1262
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 442 transition count 1262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 436 transition count 1250
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 436 transition count 1250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 430 transition count 1238
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 430 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 425 transition count 1226
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 425 transition count 1226
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 420 transition count 1216
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 418 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 417 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 416 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 415 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 415 transition count 1206
Applied a total of 124 rules in 211 ms. Remains 415 /474 variables (removed 59) and now considering 1206/1342 (removed 136) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/474 places, 1206/1342 transitions.
Normalized transition count is 680 out of 1206 initially.
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:56:57] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 2136 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 1) seen :688
[2022-06-09 09:57:00] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:57:00] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:57:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:00] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2022-06-09 09:57:00] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:57:00] [INFO ] [Real]Added 348 Read/Feed constraints in 195 ms returned sat
[2022-06-09 09:57:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:57:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:00] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-09 09:57:00] [INFO ] [Nat]Added 348 Read/Feed constraints in 232 ms returned sat
[2022-06-09 09:57:01] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 0 ms to minimize.
[2022-06-09 09:57:01] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 0 ms to minimize.
[2022-06-09 09:57:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2022-06-09 09:57:01] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 58 ms.
[2022-06-09 09:57:02] [INFO ] Added : 111 causal constraints over 23 iterations in 977 ms. Result :sat
Minimization took 796 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[688]
Incomplete Parikh walk after 356600 steps, including 1000 resets, run finished after 1159 ms. (steps per millisecond=307 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 58 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 09:57:04] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:57:04] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:57:04] [INFO ] Implicit Places using invariants in 279 ms returned []
[2022-06-09 09:57:04] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:57:04] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:57:04] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:57:08] [INFO ] Implicit Places using invariants and state equation in 4156 ms returned []
Implicit Place search using SMT with State Equation took 4437 ms to find 0 implicit places.
[2022-06-09 09:57:08] [INFO ] Redundant transitions in 18 ms returned []
[2022-06-09 09:57:08] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:57:08] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:57:09] [INFO ] Dead Transitions using invariants and state equation in 362 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Normalized transition count is 680 out of 1206 initially.
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:57:09] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2095 ms. (steps per millisecond=477 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 1) seen :0
[2022-06-09 09:57:11] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:57:11] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:57:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:12] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-06-09 09:57:12] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:57:12] [INFO ] [Real]Added 348 Read/Feed constraints in 194 ms returned sat
[2022-06-09 09:57:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:57:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:12] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-09 09:57:12] [INFO ] [Nat]Added 348 Read/Feed constraints in 225 ms returned sat
[2022-06-09 09:57:12] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 1 ms to minimize.
[2022-06-09 09:57:13] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 0 ms to minimize.
[2022-06-09 09:57:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2022-06-09 09:57:13] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 60 ms.
[2022-06-09 09:57:14] [INFO ] Added : 111 causal constraints over 23 iterations in 955 ms. Result :sat
Minimization took 802 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[688]
Incomplete Parikh walk after 356600 steps, including 1000 resets, run finished after 1180 ms. (steps per millisecond=302 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 45 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 09:57:16] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:57:16] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:57:16] [INFO ] Implicit Places using invariants in 279 ms returned []
[2022-06-09 09:57:16] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:57:16] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:57:16] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:57:18] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2022-06-09 09:57:18] [INFO ] Redundant transitions in 14 ms returned []
[2022-06-09 09:57:18] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:57:18] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:57:18] [INFO ] Dead Transitions using invariants and state equation in 367 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-01 in 24110 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-04
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:57:18] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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
[2022-06-09 09:57:18] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:57:18] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:57:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:57:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:19] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-06-09 09:57:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:57:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:19] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2022-06-09 09:57:19] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:57:19] [INFO ] [Nat]Added 417 Read/Feed constraints in 290 ms returned sat
[2022-06-09 09:57:19] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 73 ms.
[2022-06-09 09:57:20] [INFO ] Added : 20 causal constraints over 4 iterations in 294 ms. Result :sat
Minimization took 762 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 62800 steps, including 623 resets, run finished after 210 ms. (steps per millisecond=299 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 469 transition count 1332
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 469 transition count 1332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 469 transition count 1326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 464 transition count 1314
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 464 transition count 1314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 461 transition count 1308
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 461 transition count 1308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 456 transition count 1292
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 456 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 451 transition count 1282
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 451 transition count 1282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 446 transition count 1272
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 446 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 1262
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 436 transition count 1252
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 436 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 432 transition count 1242
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 432 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 428 transition count 1234
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 427 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 427 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 426 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 426 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 425 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 425 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 424 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 423 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 423 transition count 1224
Applied a total of 108 rules in 183 ms. Remains 423 /474 variables (removed 51) and now considering 1224/1342 (removed 118) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/474 places, 1224/1342 transitions.
Normalized transition count is 691 out of 1224 initially.
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:21] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2158 ms. (steps per millisecond=463 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 1) seen :205
[2022-06-09 09:57:24] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:24] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:57:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:24] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-09 09:57:24] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:57:24] [INFO ] [Real]Added 355 Read/Feed constraints in 197 ms returned sat
[2022-06-09 09:57:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:57:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:57:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:24] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-09 09:57:24] [INFO ] [Nat]Added 355 Read/Feed constraints in 172 ms returned sat
[2022-06-09 09:57:25] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 1 ms to minimize.
[2022-06-09 09:57:25] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 1 ms to minimize.
[2022-06-09 09:57:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2022-06-09 09:57:25] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 62 ms.
[2022-06-09 09:57:26] [INFO ] Added : 100 causal constraints over 20 iterations in 873 ms. Result :sat
Minimization took 720 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[205]
Incomplete Parikh walk after 288100 steps, including 1000 resets, run finished after 1062 ms. (steps per millisecond=271 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 44 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 45 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2022-06-09 09:57:28] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:28] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:57:28] [INFO ] Implicit Places using invariants in 289 ms returned []
[2022-06-09 09:57:28] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 09:57:28] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:57:32] [INFO ] Implicit Places using invariants and state equation in 4211 ms returned []
Implicit Place search using SMT with State Equation took 4502 ms to find 0 implicit places.
[2022-06-09 09:57:32] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-09 09:57:32] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:32] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:57:32] [INFO ] Dead Transitions using invariants and state equation in 382 ms returned []
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Normalized transition count is 691 out of 1224 initially.
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:32] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2184 ms. (steps per millisecond=457 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties (out of 1) seen :215
[2022-06-09 09:57:35] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:35] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:57:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:36] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-09 09:57:36] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:57:36] [INFO ] [Real]Added 355 Read/Feed constraints in 190 ms returned sat
[2022-06-09 09:57:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:57:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:36] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-09 09:57:36] [INFO ] [Nat]Added 355 Read/Feed constraints in 173 ms returned sat
[2022-06-09 09:57:36] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 1 ms to minimize.
[2022-06-09 09:57:36] [INFO ] Deduced a trap composed of 135 places in 106 ms of which 1 ms to minimize.
[2022-06-09 09:57:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2022-06-09 09:57:37] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 61 ms.
[2022-06-09 09:57:37] [INFO ] Added : 100 causal constraints over 20 iterations in 916 ms. Result :sat
Minimization took 707 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[215]
Incomplete Parikh walk after 301100 steps, including 1000 resets, run finished after 1145 ms. (steps per millisecond=262 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 53 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 44 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2022-06-09 09:57:39] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:39] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:57:40] [INFO ] Implicit Places using invariants in 300 ms returned []
[2022-06-09 09:57:40] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:40] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:57:40] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:57:42] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned []
Implicit Place search using SMT with State Equation took 2624 ms to find 0 implicit places.
[2022-06-09 09:57:42] [INFO ] Redundant transitions in 18 ms returned []
[2022-06-09 09:57:42] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:42] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:57:42] [INFO ] Dead Transitions using invariants and state equation in 361 ms returned []
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Normalized transition count is 691 out of 1224 initially.
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:42] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2244 ms. (steps per millisecond=445 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties (out of 1) seen :224
[2022-06-09 09:57:45] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:45] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:57:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:46] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-06-09 09:57:46] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:57:46] [INFO ] [Real]Added 355 Read/Feed constraints in 200 ms returned sat
[2022-06-09 09:57:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:57:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:57:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:46] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-06-09 09:57:46] [INFO ] [Nat]Added 355 Read/Feed constraints in 172 ms returned sat
[2022-06-09 09:57:46] [INFO ] Deduced a trap composed of 84 places in 160 ms of which 1 ms to minimize.
[2022-06-09 09:57:46] [INFO ] Deduced a trap composed of 135 places in 105 ms of which 1 ms to minimize.
[2022-06-09 09:57:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2022-06-09 09:57:47] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 61 ms.
[2022-06-09 09:57:47] [INFO ] Added : 100 causal constraints over 20 iterations in 896 ms. Result :sat
Minimization took 691 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[224]
Incomplete Parikh walk after 312800 steps, including 1000 resets, run finished after 1216 ms. (steps per millisecond=257 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 44 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 44 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2022-06-09 09:57:49] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:49] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:57:50] [INFO ] Implicit Places using invariants in 273 ms returned []
[2022-06-09 09:57:50] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 09:57:50] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:57:54] [INFO ] Implicit Places using invariants and state equation in 4125 ms returned []
Implicit Place search using SMT with State Equation took 4399 ms to find 0 implicit places.
[2022-06-09 09:57:54] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 09:57:54] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:54] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:57:54] [INFO ] Dead Transitions using invariants and state equation in 366 ms returned []
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Normalized transition count is 691 out of 1224 initially.
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:54] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2229 ms. (steps per millisecond=448 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 1) seen :208
[2022-06-09 09:57:57] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:57:57] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:57:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:57] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-09 09:57:57] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:57:58] [INFO ] [Real]Added 355 Read/Feed constraints in 192 ms returned sat
[2022-06-09 09:57:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:57:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:57:58] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-09 09:57:58] [INFO ] [Nat]Added 355 Read/Feed constraints in 175 ms returned sat
[2022-06-09 09:57:58] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 1 ms to minimize.
[2022-06-09 09:57:58] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 1 ms to minimize.
[2022-06-09 09:57:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2022-06-09 09:57:58] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 62 ms.
[2022-06-09 09:57:59] [INFO ] Added : 100 causal constraints over 20 iterations in 880 ms. Result :sat
Minimization took 684 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[224]
Incomplete Parikh walk after 312800 steps, including 1000 resets, run finished after 1261 ms. (steps per millisecond=248 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 64 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 44 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2022-06-09 09:58:01] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:58:01] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:58:01] [INFO ] Implicit Places using invariants in 277 ms returned []
[2022-06-09 09:58:01] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:58:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 09:58:02] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:58:04] [INFO ] Implicit Places using invariants and state equation in 2262 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
[2022-06-09 09:58:04] [INFO ] Redundant transitions in 21 ms returned []
[2022-06-09 09:58:04] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:58:04] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:58:04] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-04 in 45737 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-07
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:58:04] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 :1
[2022-06-09 09:58:04] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:58:04] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:58:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:04] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2022-06-09 09:58:04] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:58:05] [INFO ] [Real]Added 417 Read/Feed constraints in 217 ms returned sat
[2022-06-09 09:58:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:58:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:05] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2022-06-09 09:58:05] [INFO ] [Nat]Added 417 Read/Feed constraints in 275 ms returned sat
[2022-06-09 09:58:05] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 1 ms to minimize.
[2022-06-09 09:58:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-06-09 09:58:06] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 68 ms.
[2022-06-09 09:58:06] [INFO ] Added : 21 causal constraints over 5 iterations in 332 ms. Result :sat
Minimization took 815 ms.
Current structural bounds on expressions (after SMT) : [16] Max seen :[1]
Incomplete Parikh walk after 66900 steps, including 686 resets, run finished after 232 ms. (steps per millisecond=288 ) properties (out of 1) seen :13 could not realise parikh vector
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 468 transition count 1330
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 468 transition count 1330
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 20 place count 468 transition count 1322
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 462 transition count 1308
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 462 transition count 1308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 458 transition count 1300
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 458 transition count 1300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 452 transition count 1280
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 452 transition count 1280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 446 transition count 1268
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 446 transition count 1268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 440 transition count 1256
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 440 transition count 1256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 434 transition count 1244
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 434 transition count 1244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 428 transition count 1232
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 428 transition count 1232
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 423 transition count 1220
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 423 transition count 1220
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 418 transition count 1210
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 417 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 416 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 416 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 415 transition count 1204
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 414 transition count 1202
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 413 transition count 1200
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 413 transition count 1200
Applied a total of 130 rules in 194 ms. Remains 413 /474 variables (removed 61) and now considering 1200/1342 (removed 142) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/474 places, 1200/1342 transitions.
Normalized transition count is 675 out of 1200 initially.
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:58:07] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2160 ms. (steps per millisecond=462 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 1) seen :0
[2022-06-09 09:58:10] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:58:10] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:58:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:10] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-06-09 09:58:10] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:58:10] [INFO ] [Real]Added 343 Read/Feed constraints in 198 ms returned sat
[2022-06-09 09:58:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:58:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:58:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:10] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-09 09:58:11] [INFO ] [Nat]Added 343 Read/Feed constraints in 192 ms returned sat
[2022-06-09 09:58:11] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 1 ms to minimize.
[2022-06-09 09:58:11] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 0 ms to minimize.
[2022-06-09 09:58:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2022-06-09 09:58:11] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 61 ms.
[2022-06-09 09:58:11] [INFO ] Added : 44 causal constraints over 9 iterations in 448 ms. Result :sat
Minimization took 720 ms.
Current structural bounds on expressions (after SMT) : [16] Max seen :[13]
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 53 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 55 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2022-06-09 09:58:12] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:58:12] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:58:13] [INFO ] Implicit Places using invariants in 283 ms returned []
[2022-06-09 09:58:13] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:58:13] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:58:13] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:58:15] [INFO ] Implicit Places using invariants and state equation in 2597 ms returned []
Implicit Place search using SMT with State Equation took 2881 ms to find 0 implicit places.
[2022-06-09 09:58:15] [INFO ] Redundant transitions in 18 ms returned []
[2022-06-09 09:58:15] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:58:15] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:58:16] [INFO ] Dead Transitions using invariants and state equation in 355 ms returned []
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-07 in 11477 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-09
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:58:16] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :3
[2022-06-09 09:58:16] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:58:16] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:58:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:16] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-06-09 09:58:16] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:58:16] [INFO ] [Real]Added 417 Read/Feed constraints in 200 ms returned sat
[2022-06-09 09:58:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:58:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:16] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:58:17] [INFO ] [Nat]Added 417 Read/Feed constraints in 288 ms returned sat
[2022-06-09 09:58:17] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 68 ms.
[2022-06-09 09:58:17] [INFO ] Added : 20 causal constraints over 4 iterations in 285 ms. Result :sat
Minimization took 786 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Incomplete Parikh walk after 61600 steps, including 567 resets, run finished after 207 ms. (steps per millisecond=297 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 469 transition count 1332
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 469 transition count 1332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 469 transition count 1326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 464 transition count 1314
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 464 transition count 1314
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 460 transition count 1306
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 460 transition count 1306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 454 transition count 1286
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 454 transition count 1286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 448 transition count 1274
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 448 transition count 1274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 442 transition count 1262
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 442 transition count 1262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 436 transition count 1250
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 436 transition count 1250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 430 transition count 1238
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 430 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 425 transition count 1226
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 425 transition count 1226
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 420 transition count 1216
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 418 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 417 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 416 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 415 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 415 transition count 1206
Applied a total of 124 rules in 183 ms. Remains 415 /474 variables (removed 59) and now considering 1206/1342 (removed 136) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/474 places, 1206/1342 transitions.
Normalized transition count is 680 out of 1206 initially.
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:18] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2113 ms. (steps per millisecond=473 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 1) seen :651
[2022-06-09 09:58:21] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:21] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:58:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:21] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-06-09 09:58:21] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:58:21] [INFO ] [Real]Added 348 Read/Feed constraints in 188 ms returned sat
[2022-06-09 09:58:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:58:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:22] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-06-09 09:58:22] [INFO ] [Nat]Added 348 Read/Feed constraints in 174 ms returned sat
[2022-06-09 09:58:22] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 1 ms to minimize.
[2022-06-09 09:58:22] [INFO ] Deduced a trap composed of 178 places in 153 ms of which 1 ms to minimize.
[2022-06-09 09:58:22] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 7 ms to minimize.
[2022-06-09 09:58:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 527 ms
[2022-06-09 09:58:22] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 59 ms.
[2022-06-09 09:58:23] [INFO ] Added : 99 causal constraints over 20 iterations in 912 ms. Result :sat
Minimization took 718 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[651]
Incomplete Parikh walk after 338200 steps, including 1000 resets, run finished after 1279 ms. (steps per millisecond=264 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 48 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 09:58:25] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:25] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:58:26] [INFO ] Implicit Places using invariants in 278 ms returned []
[2022-06-09 09:58:26] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:26] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:58:26] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:58:28] [INFO ] Implicit Places using invariants and state equation in 2264 ms returned []
Implicit Place search using SMT with State Equation took 2544 ms to find 0 implicit places.
[2022-06-09 09:58:28] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 09:58:28] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:28] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:58:28] [INFO ] Dead Transitions using invariants and state equation in 351 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Normalized transition count is 680 out of 1206 initially.
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:28] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2136 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties (out of 1) seen :624
[2022-06-09 09:58:31] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:31] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:58:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:31] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-09 09:58:31] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:58:31] [INFO ] [Real]Added 348 Read/Feed constraints in 192 ms returned sat
[2022-06-09 09:58:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:58:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:32] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-06-09 09:58:32] [INFO ] [Nat]Added 348 Read/Feed constraints in 172 ms returned sat
[2022-06-09 09:58:32] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 0 ms to minimize.
[2022-06-09 09:58:32] [INFO ] Deduced a trap composed of 178 places in 149 ms of which 1 ms to minimize.
[2022-06-09 09:58:32] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 0 ms to minimize.
[2022-06-09 09:58:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 515 ms
[2022-06-09 09:58:32] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 77 ms.
[2022-06-09 09:58:33] [INFO ] Added : 99 causal constraints over 20 iterations in 928 ms. Result :sat
Minimization took 718 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[651]
Incomplete Parikh walk after 338200 steps, including 1000 resets, run finished after 1090 ms. (steps per millisecond=310 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 09:58:35] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:35] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:58:35] [INFO ] Implicit Places using invariants in 286 ms returned []
[2022-06-09 09:58:35] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:35] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:58:36] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:58:38] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2433 ms to find 0 implicit places.
[2022-06-09 09:58:38] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 09:58:38] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:58:38] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:58:38] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-09 in 22363 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-10
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:58:38] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-06-09 09:58:38] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:58:38] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:58:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:38] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-06-09 09:58:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:58:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:38] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:58:39] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:58:39] [INFO ] [Nat]Added 417 Read/Feed constraints in 280 ms returned sat
[2022-06-09 09:58:39] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 1 ms to minimize.
[2022-06-09 09:58:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-06-09 09:58:39] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 70 ms.
[2022-06-09 09:58:39] [INFO ] Added : 20 causal constraints over 4 iterations in 284 ms. Result :sat
Minimization took 774 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[13]
Incomplete Parikh walk after 81200 steps, including 783 resets, run finished after 249 ms. (steps per millisecond=326 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 469 transition count 1332
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 469 transition count 1332
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 18 place count 469 transition count 1324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 464 transition count 1312
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 464 transition count 1312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 461 transition count 1306
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 461 transition count 1306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 456 transition count 1288
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 456 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 451 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 451 transition count 1278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 446 transition count 1268
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 446 transition count 1268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 441 transition count 1258
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 441 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 436 transition count 1248
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 436 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 432 transition count 1240
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 432 transition count 1240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 428 transition count 1232
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 428 transition count 1232
Applied a total of 100 rules in 142 ms. Remains 428 /474 variables (removed 46) and now considering 1232/1342 (removed 110) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/474 places, 1232/1342 transitions.
Normalized transition count is 697 out of 1232 initially.
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:58:40] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2257 ms. (steps per millisecond=443 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 1) seen :181
[2022-06-09 09:58:43] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:58:43] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:58:43] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:44] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-09 09:58:44] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:58:44] [INFO ] [Real]Added 358 Read/Feed constraints in 201 ms returned sat
[2022-06-09 09:58:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:58:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:44] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-06-09 09:58:44] [INFO ] [Nat]Added 358 Read/Feed constraints in 180 ms returned sat
[2022-06-09 09:58:44] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 0 ms to minimize.
[2022-06-09 09:58:45] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2022-06-09 09:58:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2022-06-09 09:58:45] [INFO ] Computed and/alt/rep : 341/1263/334 causal constraints (skipped 361 transitions) in 59 ms.
[2022-06-09 09:58:45] [INFO ] Added : 99 causal constraints over 20 iterations in 871 ms. Result :sat
Minimization took 780 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[181]
Incomplete Parikh walk after 341400 steps, including 1000 resets, run finished after 1381 ms. (steps per millisecond=247 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 428 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2022-06-09 09:58:48] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:58:48] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:58:48] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-06-09 09:58:48] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:58:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 09:58:48] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:58:50] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 2134 ms to find 0 implicit places.
[2022-06-09 09:58:50] [INFO ] Redundant transitions in 16 ms returned []
[2022-06-09 09:58:50] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:58:50] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:58:50] [INFO ] Dead Transitions using invariants and state equation in 378 ms returned []
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1232/1232 transitions.
Normalized transition count is 697 out of 1232 initially.
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:58:50] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2191 ms. (steps per millisecond=456 ) properties (out of 1) seen :23
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 1) seen :191
[2022-06-09 09:58:53] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:58:53] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:58:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:53] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-06-09 09:58:53] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:58:54] [INFO ] [Real]Added 358 Read/Feed constraints in 196 ms returned sat
[2022-06-09 09:58:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:58:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:58:54] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 09:58:54] [INFO ] [Nat]Added 358 Read/Feed constraints in 180 ms returned sat
[2022-06-09 09:58:54] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 1 ms to minimize.
[2022-06-09 09:58:54] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2022-06-09 09:58:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2022-06-09 09:58:54] [INFO ] Computed and/alt/rep : 341/1263/334 causal constraints (skipped 361 transitions) in 63 ms.
[2022-06-09 09:58:55] [INFO ] Added : 99 causal constraints over 20 iterations in 924 ms. Result :sat
Minimization took 791 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[191]
Incomplete Parikh walk after 359400 steps, including 1000 resets, run finished after 1303 ms. (steps per millisecond=275 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 428 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 44 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 44 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2022-06-09 09:58:57] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:58:57] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:58:58] [INFO ] Implicit Places using invariants in 287 ms returned []
[2022-06-09 09:58:58] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:58:58] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:58:58] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:59:02] [INFO ] Implicit Places using invariants and state equation in 3846 ms returned []
Implicit Place search using SMT with State Equation took 4135 ms to find 0 implicit places.
[2022-06-09 09:59:02] [INFO ] Redundant transitions in 22 ms returned []
[2022-06-09 09:59:02] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:59:02] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:59:02] [INFO ] Dead Transitions using invariants and state equation in 405 ms returned []
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1232/1232 transitions.
Normalized transition count is 697 out of 1232 initially.
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:59:02] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2181 ms. (steps per millisecond=458 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 1) seen :183
[2022-06-09 09:59:05] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:59:05] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 09:59:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:05] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-06-09 09:59:05] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:59:05] [INFO ] [Real]Added 358 Read/Feed constraints in 195 ms returned sat
[2022-06-09 09:59:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:59:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:06] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 09:59:06] [INFO ] [Nat]Added 358 Read/Feed constraints in 177 ms returned sat
[2022-06-09 09:59:06] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 1 ms to minimize.
[2022-06-09 09:59:06] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 1 ms to minimize.
[2022-06-09 09:59:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2022-06-09 09:59:06] [INFO ] Computed and/alt/rep : 341/1263/334 causal constraints (skipped 361 transitions) in 61 ms.
[2022-06-09 09:59:07] [INFO ] Added : 99 causal constraints over 20 iterations in 901 ms. Result :sat
Minimization took 791 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[191]
Incomplete Parikh walk after 359400 steps, including 1000 resets, run finished after 1270 ms. (steps per millisecond=282 ) properties (out of 1) seen :15 could not realise parikh vector
Support contains 1 out of 428 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 44 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 44 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2022-06-09 09:59:09] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:59:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:59:09] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-06-09 09:59:09] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:59:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:59:10] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:59:12] [INFO ] Implicit Places using invariants and state equation in 3030 ms returned []
Implicit Place search using SMT with State Equation took 3310 ms to find 0 implicit places.
[2022-06-09 09:59:12] [INFO ] Redundant transitions in 21 ms returned []
[2022-06-09 09:59:12] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2022-06-09 09:59:12] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:59:13] [INFO ] Dead Transitions using invariants and state equation in 377 ms returned []
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1232/1232 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-10 in 34854 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-13
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:59:13] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2022-06-09 09:59:13] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:59:13] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:59:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:13] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-06-09 09:59:13] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:59:13] [INFO ] [Real]Added 417 Read/Feed constraints in 234 ms returned sat
[2022-06-09 09:59:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:59:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:59:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:14] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2022-06-09 09:59:14] [INFO ] [Nat]Added 417 Read/Feed constraints in 271 ms returned sat
[2022-06-09 09:59:14] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 0 ms to minimize.
[2022-06-09 09:59:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-06-09 09:59:14] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 70 ms.
[2022-06-09 09:59:14] [INFO ] Added : 20 causal constraints over 4 iterations in 288 ms. Result :sat
Minimization took 776 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Incomplete Parikh walk after 66600 steps, including 638 resets, run finished after 196 ms. (steps per millisecond=339 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 469 transition count 1332
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 469 transition count 1332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 469 transition count 1326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 464 transition count 1314
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 464 transition count 1314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 461 transition count 1308
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 461 transition count 1308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 457 transition count 1296
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 457 transition count 1296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 453 transition count 1288
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 453 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 449 transition count 1280
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 449 transition count 1280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 445 transition count 1272
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 445 transition count 1272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 441 transition count 1264
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 441 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 1252
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 433 transition count 1244
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 433 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 431 transition count 1240
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 431 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 429 transition count 1236
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 429 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 427 transition count 1232
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 427 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 425 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 425 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 423 transition count 1224
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 423 transition count 1224
Applied a total of 108 rules in 186 ms. Remains 423 /474 variables (removed 51) and now considering 1224/1342 (removed 118) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/474 places, 1224/1342 transitions.
Normalized transition count is 691 out of 1224 initially.
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:16] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2226 ms. (steps per millisecond=449 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 1) seen :206
[2022-06-09 09:59:18] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:18] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:59:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:19] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-06-09 09:59:19] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:59:19] [INFO ] [Real]Added 355 Read/Feed constraints in 190 ms returned sat
[2022-06-09 09:59:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:59:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2022-06-09 09:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:19] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-09 09:59:19] [INFO ] [Nat]Added 355 Read/Feed constraints in 174 ms returned sat
[2022-06-09 09:59:19] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 0 ms to minimize.
[2022-06-09 09:59:20] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 7 ms to minimize.
[2022-06-09 09:59:20] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 1 ms to minimize.
[2022-06-09 09:59:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 533 ms
[2022-06-09 09:59:20] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 61 ms.
[2022-06-09 09:59:21] [INFO ] Added : 97 causal constraints over 20 iterations in 892 ms. Result :sat
Minimization took 774 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[206]
Incomplete Parikh walk after 285600 steps, including 1000 resets, run finished after 1202 ms. (steps per millisecond=237 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 43 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 44 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2022-06-09 09:59:23] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:23] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:59:23] [INFO ] Implicit Places using invariants in 282 ms returned []
[2022-06-09 09:59:23] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:23] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:59:23] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:59:25] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2385 ms to find 0 implicit places.
[2022-06-09 09:59:25] [INFO ] Redundant transitions in 18 ms returned []
[2022-06-09 09:59:25] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:25] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:59:26] [INFO ] Dead Transitions using invariants and state equation in 362 ms returned []
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Normalized transition count is 691 out of 1224 initially.
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:26] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2206 ms. (steps per millisecond=453 ) properties (out of 1) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 1) seen :196
[2022-06-09 09:59:28] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:28] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:59:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:29] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-09 09:59:29] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:59:29] [INFO ] [Real]Added 355 Read/Feed constraints in 189 ms returned sat
[2022-06-09 09:59:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:59:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:29] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-06-09 09:59:29] [INFO ] [Nat]Added 355 Read/Feed constraints in 171 ms returned sat
[2022-06-09 09:59:29] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 1 ms to minimize.
[2022-06-09 09:59:30] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 1 ms to minimize.
[2022-06-09 09:59:30] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 0 ms to minimize.
[2022-06-09 09:59:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 533 ms
[2022-06-09 09:59:30] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 120 ms.
[2022-06-09 09:59:31] [INFO ] Added : 97 causal constraints over 20 iterations in 936 ms. Result :sat
Minimization took 775 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[206]
Incomplete Parikh walk after 285600 steps, including 1000 resets, run finished after 1228 ms. (steps per millisecond=232 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 43 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 43 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2022-06-09 09:59:33] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:33] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:59:33] [INFO ] Implicit Places using invariants in 274 ms returned []
[2022-06-09 09:59:33] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 09:59:33] [INFO ] State equation strengthened by 355 read => feed constraints.
[2022-06-09 09:59:37] [INFO ] Implicit Places using invariants and state equation in 4066 ms returned []
Implicit Place search using SMT with State Equation took 4344 ms to find 0 implicit places.
[2022-06-09 09:59:37] [INFO ] Redundant transitions in 15 ms returned []
[2022-06-09 09:59:37] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2022-06-09 09:59:37] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:59:38] [INFO ] Dead Transitions using invariants and state equation in 351 ms returned []
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1224/1224 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-13 in 24696 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-15
Normalized transition count is 776 out of 1342 initially.
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:59:38] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-06-09 09:59:38] [INFO ] Flow matrix only has 776 transitions (discarded 566 similar events)
// Phase 1: matrix 776 rows 474 cols
[2022-06-09 09:59:38] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:59:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:38] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2022-06-09 09:59:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:59:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:59:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:38] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-06-09 09:59:38] [INFO ] State equation strengthened by 417 read => feed constraints.
[2022-06-09 09:59:38] [INFO ] [Nat]Added 417 Read/Feed constraints in 275 ms returned sat
[2022-06-09 09:59:38] [INFO ] Computed and/alt/rep : 99/103/84 causal constraints (skipped 690 transitions) in 68 ms.
[2022-06-09 09:59:39] [INFO ] Added : 20 causal constraints over 4 iterations in 286 ms. Result :sat
Minimization took 902 ms.
Current structural bounds on expressions (after SMT) : [16] Max seen :[0]
Incomplete Parikh walk after 61200 steps, including 674 resets, run finished after 151 ms. (steps per millisecond=405 ) properties (out of 1) seen :13 could not realise parikh vector
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1342/1342 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 468 transition count 1330
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 468 transition count 1330
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 20 place count 468 transition count 1322
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 462 transition count 1308
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 462 transition count 1308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 458 transition count 1300
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 458 transition count 1300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 452 transition count 1280
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 452 transition count 1280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 446 transition count 1268
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 446 transition count 1268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 440 transition count 1256
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 440 transition count 1256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 434 transition count 1244
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 434 transition count 1244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 428 transition count 1232
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 428 transition count 1232
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 423 transition count 1220
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 423 transition count 1220
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 418 transition count 1210
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 417 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 416 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 416 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 415 transition count 1204
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 414 transition count 1202
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 413 transition count 1200
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 413 transition count 1200
Applied a total of 130 rules in 178 ms. Remains 413 /474 variables (removed 61) and now considering 1200/1342 (removed 142) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/474 places, 1200/1342 transitions.
Normalized transition count is 675 out of 1200 initially.
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:40] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2072 ms. (steps per millisecond=482 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 1) seen :2
[2022-06-09 09:59:43] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:43] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:59:43] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:43] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-06-09 09:59:43] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:59:43] [INFO ] [Real]Added 343 Read/Feed constraints in 199 ms returned sat
[2022-06-09 09:59:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:59:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:43] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2022-06-09 09:59:43] [INFO ] [Nat]Added 343 Read/Feed constraints in 189 ms returned sat
[2022-06-09 09:59:44] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 1 ms to minimize.
[2022-06-09 09:59:44] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 0 ms to minimize.
[2022-06-09 09:59:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2022-06-09 09:59:44] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 61 ms.
[2022-06-09 09:59:45] [INFO ] Added : 82 causal constraints over 17 iterations in 706 ms. Result :sat
Minimization took 770 ms.
Current structural bounds on expressions (after SMT) : [16] Max seen :[13]
Incomplete Parikh walk after 16800 steps, including 327 resets, run finished after 71 ms. (steps per millisecond=236 ) properties (out of 1) seen :15 could not realise parikh vector
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 42 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 42 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2022-06-09 09:59:45] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:46] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:59:46] [INFO ] Implicit Places using invariants in 287 ms returned []
[2022-06-09 09:59:46] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:46] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:59:46] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:59:49] [INFO ] Implicit Places using invariants and state equation in 3258 ms returned []
Implicit Place search using SMT with State Equation took 3546 ms to find 0 implicit places.
[2022-06-09 09:59:49] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 09:59:49] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:49] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:59:49] [INFO ] Dead Transitions using invariants and state equation in 350 ms returned []
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Normalized transition count is 675 out of 1200 initially.
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:49] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2163 ms. (steps per millisecond=462 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 639 ms. (steps per millisecond=1564 ) properties (out of 1) seen :0
[2022-06-09 09:59:52] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:52] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:59:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:52] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-09 09:59:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:59:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:59:53] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 09:59:53] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:59:53] [INFO ] [Nat]Added 343 Read/Feed constraints in 184 ms returned sat
[2022-06-09 09:59:53] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 0 ms to minimize.
[2022-06-09 09:59:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-06-09 09:59:53] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 59 ms.
[2022-06-09 09:59:54] [INFO ] Added : 74 causal constraints over 15 iterations in 583 ms. Result :sat
Minimization took 713 ms.
Current structural bounds on expressions (after SMT) : [16] Max seen :[15]
Incomplete Parikh walk after 40400 steps, including 401 resets, run finished after 62 ms. (steps per millisecond=651 ) properties (out of 1) seen :12 could not realise parikh vector
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 42 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 42 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2022-06-09 09:59:54] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:54] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:59:55] [INFO ] Implicit Places using invariants in 275 ms returned []
[2022-06-09 09:59:55] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:55] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:59:55] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:59:59] [INFO ] Implicit Places using invariants and state equation in 4154 ms returned []
Implicit Place search using SMT with State Equation took 4433 ms to find 0 implicit places.
[2022-06-09 09:59:59] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-09 09:59:59] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:59:59] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:59:59] [INFO ] Dead Transitions using invariants and state equation in 345 ms returned []
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-15 in 21718 ms.
[2022-06-09 10:00:00] [INFO ] Flatten gal took : 144 ms
[2022-06-09 10:00:00] [INFO ] Applying decomposition
[2022-06-09 10:00:00] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12718174041195495277.txt, -o, /tmp/graph12718174041195495277.bin, -w, /tmp/graph12718174041195495277.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12718174041195495277.bin, -l, -1, -v, -w, /tmp/graph12718174041195495277.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:00:00] [INFO ] Decomposing Gal with order
[2022-06-09 10:00:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:00:00] [INFO ] Removed a total of 2322 redundant transitions.
[2022-06-09 10:00:00] [INFO ] Flatten gal took : 159 ms
[2022-06-09 10:00:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 941 labels/synchronizations in 73 ms.
[2022-06-09 10:00:00] [INFO ] Time to serialize gal into /tmp/UpperBounds14384519356277996777.gal : 14 ms
[2022-06-09 10:00:00] [INFO ] Time to serialize properties into /tmp/UpperBounds3601333038879807214.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14384519356277996777.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3601333038879807214.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14384519356277996777.gal -t CGAL -reachable-file /tmp/UpperBounds3601333038879807214.prop --nowitness
Loading property file /tmp/UpperBounds3601333038879807214.prop.
Detected timeout of ITS tools.
[2022-06-09 10:22:51] [INFO ] Flatten gal took : 59 ms
[2022-06-09 10:22:51] [INFO ] Time to serialize gal into /tmp/UpperBounds18068063307595912844.gal : 6 ms
[2022-06-09 10:22:51] [INFO ] Time to serialize properties into /tmp/UpperBounds16929084775152673897.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds18068063307595912844.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16929084775152673897.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds18068063307595912844.gal -t CGAL -reachable-file /tmp/UpperBounds16929084775152673897.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds16929084775152673897.prop.
Detected timeout of ITS tools.
[2022-06-09 10:45:43] [INFO ] Flatten gal took : 66 ms
[2022-06-09 10:45:43] [INFO ] Input system was already deterministic with 1342 transitions.
[2022-06-09 10:45:43] [INFO ] Transformed 474 places.
[2022-06-09 10:45:43] [INFO ] Transformed 1342 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 10:45:43] [INFO ] Time to serialize gal into /tmp/UpperBounds7879406084675686367.gal : 4 ms
[2022-06-09 10:45:43] [INFO ] Time to serialize properties into /tmp/UpperBounds14305771158632207970.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7879406084675686367.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14305771158632207970.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7879406084675686367.gal -t CGAL -reachable-file /tmp/UpperBounds14305771158632207970.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14305771158632207970.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is FunctionPointer-PT-c016, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r323-tall-165472292800187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;