About the Execution of ITS-Tools for BugTracking-PT-q8m128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 0 0 ? 0 0 0 0 0 0 0 0 0 0 0 0 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765400597.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BugTracking-PT-q8m128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765400597
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749235263047
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-06 18:41:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 18:41:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 18:41:06] [INFO ] Load time of PNML (sax parser for PT used): 1208 ms
[2025-06-06 18:41:06] [INFO ] Transformed 754 places.
[2025-06-06 18:41:06] [INFO ] Transformed 27370 transitions.
[2025-06-06 18:41:06] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1465 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 474 places in 158 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-06 18:41:06] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2025-06-06 18:41:06] [INFO ] Computed 10 invariants in 92 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 144 ms. (68 steps per ms)
FORMULA BugTracking-PT-q8m128-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (22 resets) in 340 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
[2025-06-06 18:41:07] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2025-06-06 18:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:07] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-06 18:41:09] [INFO ] [Real]Absence check using state equation in 1474 ms returned sat
[2025-06-06 18:41:09] [INFO ] State equation strengthened by 303 read => feed constraints.
[2025-06-06 18:41:09] [INFO ] [Real]Added 303 Read/Feed constraints in 208 ms returned sat
[2025-06-06 18:41:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:41:11] [INFO ] [Nat]Absence check using state equation in 940 ms returned sat
[2025-06-06 18:41:11] [INFO ] [Nat]Added 303 Read/Feed constraints in 241 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:12] [INFO ] Deduced a trap composed of 14 places in 976 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:13] [INFO ] Deduced a trap composed of 40 places in 990 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:14] [INFO ] Deduced a trap composed of 41 places in 1220 ms of which 29 ms to minimize.
[2025-06-06 18:41:15] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 3724 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:15] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-06 18:41:16] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2025-06-06 18:41:16] [INFO ] [Real]Added 303 Read/Feed constraints in 119 ms returned sat
[2025-06-06 18:41:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-06 18:41:17] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2025-06-06 18:41:17] [INFO ] [Nat]Added 303 Read/Feed constraints in 263 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:18] [INFO ] Deduced a trap composed of 14 places in 947 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:19] [INFO ] Deduced a trap composed of 41 places in 896 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:21] [INFO ] Deduced a trap composed of 42 places in 1470 ms of which 46 ms to minimize.
[2025-06-06 18:41:21] [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 1
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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:21] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-06 18:41:23] [INFO ] [Real]Absence check using state equation in 1934 ms returned sat
[2025-06-06 18:41:23] [INFO ] [Real]Added 303 Read/Feed constraints in 119 ms returned sat
[2025-06-06 18:41:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:41:24] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2025-06-06 18:41:25] [INFO ] [Nat]Added 303 Read/Feed constraints in 348 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:25] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:26] [INFO ] Deduced a trap composed of 14 places in 883 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:27] [INFO ] Deduced a trap composed of 39 places in 469 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:28] [INFO ] Deduced a trap composed of 50 places in 631 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:28] [INFO ] Deduced a trap composed of 51 places in 544 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:29] [INFO ] Deduced a trap composed of 51 places in 632 ms of which 25 ms to minimize.
[2025-06-06 18:41:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:29] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:41:30] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2025-06-06 18:41:30] [INFO ] [Real]Added 303 Read/Feed constraints in 148 ms returned sat
[2025-06-06 18:41:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-06 18:41:31] [INFO ] [Nat]Absence check using state equation in 852 ms returned sat
[2025-06-06 18:41:32] [INFO ] [Nat]Added 303 Read/Feed constraints in 340 ms returned sat
[2025-06-06 18:41:32] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 505 ms.
[2025-06-06 18:41:33] [INFO ] Added : 11 causal constraints over 3 iterations in 1436 ms. Result :sat
Minimization took 1276 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:34] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:41:35] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2025-06-06 18:41:36] [INFO ] [Real]Added 303 Read/Feed constraints in 108 ms returned sat
[2025-06-06 18:41:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:41:37] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2025-06-06 18:41:37] [INFO ] [Nat]Added 303 Read/Feed constraints in 442 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:38] [INFO ] Deduced a trap composed of 39 places in 900 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:39] [INFO ] Deduced a trap composed of 51 places in 903 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:40] [INFO ] Deduced a trap composed of 51 places in 870 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:41] [INFO ] Deduced a trap composed of 52 places in 834 ms of which 26 ms to minimize.
[2025-06-06 18:41:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:41] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-06 18:41:42] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2025-06-06 18:41:42] [INFO ] [Real]Added 303 Read/Feed constraints in 125 ms returned sat
[2025-06-06 18:41:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:41:43] [INFO ] [Nat]Absence check using state equation in 1007 ms returned sat
[2025-06-06 18:41:44] [INFO ] [Nat]Added 303 Read/Feed constraints in 498 ms returned sat
[2025-06-06 18:41:45] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 793 ms.
[2025-06-06 18:41:45] [INFO ] Added : 5 causal constraints over 1 iterations in 1527 ms. Result :sat
Minimization took 1577 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:47] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-06 18:41:48] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2025-06-06 18:41:48] [INFO ] [Real]Added 303 Read/Feed constraints in 145 ms returned sat
[2025-06-06 18:41:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:41:49] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2025-06-06 18:41:50] [INFO ] [Nat]Added 303 Read/Feed constraints in 206 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:50] [INFO ] Deduced a trap composed of 14 places in 880 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:51] [INFO ] Deduced a trap composed of 40 places in 693 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:52] [INFO ] Deduced a trap composed of 42 places in 876 ms of which 23 ms to minimize.
[2025-06-06 18:41:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2860 ms
[2025-06-06 18:41:53] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 363 ms.
[2025-06-06 18:41:53] [INFO ] Added : 5 causal constraints over 1 iterations in 852 ms. Result :sat
Minimization took 138 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:53] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-06 18:41:55] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2025-06-06 18:41:55] [INFO ] [Real]Added 303 Read/Feed constraints in 102 ms returned sat
[2025-06-06 18:41:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:41:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:41:56] [INFO ] [Nat]Absence check using state equation in 1043 ms returned sat
[2025-06-06 18:41:56] [INFO ] [Nat]Added 303 Read/Feed constraints in 288 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:41:57] [INFO ] Deduced a trap composed of 13 places in 338 ms of which 7 ms to minimize.
[2025-06-06 18:41:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 571 ms
[2025-06-06 18:41:57] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 387 ms.
[2025-06-06 18:41:59] [INFO ] Added : 15 causal constraints over 3 iterations in 1744 ms. Result :sat
Minimization took 1276 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:42:00] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:42:01] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2025-06-06 18:42:01] [INFO ] [Real]Added 303 Read/Feed constraints in 116 ms returned sat
[2025-06-06 18:42:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:42:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-06 18:42:02] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2025-06-06 18:42:02] [INFO ] [Nat]Added 303 Read/Feed constraints in 189 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:03] [INFO ] Deduced a trap composed of 35 places in 662 ms of which 19 ms to minimize.
[2025-06-06 18:42:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 910 ms
[2025-06-06 18:42:04] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 395 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:05] [INFO ] Deduced a trap composed of 14 places in 696 ms of which 16 ms to minimize.
[2025-06-06 18:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 989 ms
[2025-06-06 18:42:06] [INFO ] Added : 11 causal constraints over 3 iterations in 2634 ms. Result :sat
Minimization took 273 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:42:06] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 18:42:07] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2025-06-06 18:42:07] [INFO ] [Real]Added 303 Read/Feed constraints in 96 ms returned sat
[2025-06-06 18:42:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:42:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-06 18:42:09] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2025-06-06 18:42:09] [INFO ] [Nat]Added 303 Read/Feed constraints in 136 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:09] [INFO ] Deduced a trap composed of 11 places in 646 ms of which 17 ms to minimize.
[2025-06-06 18:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 897 ms
[2025-06-06 18:42:10] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 388 ms.
[2025-06-06 18:42:10] [INFO ] Added : 2 causal constraints over 1 iterations in 932 ms. Result :sat
Minimization took 1441 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:42:12] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-06 18:42:13] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2025-06-06 18:42:13] [INFO ] [Real]Added 303 Read/Feed constraints in 133 ms returned sat
[2025-06-06 18:42:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:42:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-06 18:42:14] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2025-06-06 18:42:14] [INFO ] [Nat]Added 303 Read/Feed constraints in 142 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:15] [INFO ] Deduced a trap composed of 50 places in 902 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:16] [INFO ] Deduced a trap composed of 51 places in 674 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:17] [INFO ] Deduced a trap composed of 39 places in 778 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:18] [INFO ] Deduced a trap composed of 50 places in 803 ms of which 37 ms to minimize.
[2025-06-06 18:42:18] [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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
Support contains 11 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 460 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 269/280 places, 3871/3904 transitions.
[2025-06-06 18:42:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
[2025-06-06 18:42:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2025-06-06 18:42:21] [INFO ] Computed 8 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
RANDOM walk for 1000063 steps (2 resets) in 938 ms. (1065 steps per ms)
BEST_FIRST walk for 11000008 steps (22 resets) in 29418 ms. (373 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
[2025-06-06 18:42:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-06-06 18:42:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:42:51] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:42:52] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2025-06-06 18:42:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:42:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:42:53] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2025-06-06 18:42:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-06-06 18:42:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 182 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:54] [INFO ] Deduced a trap composed of 14 places in 726 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:55] [INFO ] Deduced a trap composed of 38 places in 712 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:56] [INFO ] Deduced a trap composed of 49 places in 710 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:57] [INFO ] Deduced a trap composed of 38 places in 882 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:42:58] [INFO ] Deduced a trap composed of 37 places in 845 ms of which 24 ms to minimize.
[2025-06-06 18:42:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4741 ms
[2025-06-06 18:42:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 405 ms.
[2025-06-06 18:42:59] [INFO ] Added : 8 causal constraints over 2 iterations in 1230 ms. Result :sat
Minimization took 4447 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:43:05] [INFO ] [Real]Absence check using state equation in 862 ms returned sat
[2025-06-06 18:43:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:43:06] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2025-06-06 18:43:06] [INFO ] [Nat]Added 283 Read/Feed constraints in 287 ms returned sat
[2025-06-06 18:43:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 367 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:08] [INFO ] Deduced a trap composed of 10 places in 304 ms of which 11 ms to minimize.
[2025-06-06 18:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
[2025-06-06 18:43:08] [INFO ] Added : 4 causal constraints over 2 iterations in 1758 ms. Result :sat
Minimization took 4085 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:43:13] [INFO ] [Real]Absence check using state equation in 861 ms returned sat
[2025-06-06 18:43:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:43:14] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2025-06-06 18:43:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 276 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:15] [INFO ] Deduced a trap composed of 10 places in 425 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:15] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 7 ms to minimize.
[2025-06-06 18:43:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1031 ms
[2025-06-06 18:43:16] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 335 ms.
[2025-06-06 18:43:16] [INFO ] Added : 8 causal constraints over 2 iterations in 934 ms. Result :sat
Minimization took 4198 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:21] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:43:22] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2025-06-06 18:43:22] [INFO ] [Real]Added 283 Read/Feed constraints in 98 ms returned sat
[2025-06-06 18:43:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:43:23] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2025-06-06 18:43:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 320 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:24] [INFO ] Deduced a trap composed of 10 places in 683 ms of which 23 ms to minimize.
[2025-06-06 18:43:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 906 ms
[2025-06-06 18:43:24] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 348 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:28] [INFO ] Deduced a trap composed of 5 places in 2615 ms of which 2300 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:28] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 5 ms to minimize.
[2025-06-06 18:43:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3273 ms
[2025-06-06 18:43:29] [INFO ] Added : 9 causal constraints over 3 iterations in 4558 ms. Result :sat
Minimization took 4062 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:33] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:43:34] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2025-06-06 18:43:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:43:35] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2025-06-06 18:43:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 319 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:36] [INFO ] Deduced a trap composed of 14 places in 527 ms of which 16 ms to minimize.
[2025-06-06 18:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 724 ms
[2025-06-06 18:43:36] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 345 ms.
[2025-06-06 18:43:37] [INFO ] Added : 3 causal constraints over 1 iterations in 762 ms. Result :sat
Minimization took 4190 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:41] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:43:42] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2025-06-06 18:43:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 18:43:43] [INFO ] [Nat]Absence check using state equation in 882 ms returned sat
[2025-06-06 18:43:43] [INFO ] [Nat]Added 283 Read/Feed constraints in 322 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:44] [INFO ] Deduced a trap composed of 35 places in 843 ms of which 25 ms to minimize.
[2025-06-06 18:43:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1036 ms
[2025-06-06 18:43:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 352 ms.
[2025-06-06 18:43:45] [INFO ] Added : 2 causal constraints over 1 iterations in 757 ms. Result :sat
Minimization took 4059 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:49] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:43:50] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2025-06-06 18:43:50] [INFO ] [Real]Added 283 Read/Feed constraints in 67 ms returned sat
[2025-06-06 18:43:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:43:51] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2025-06-06 18:43:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 188 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:52] [INFO ] Deduced a trap composed of 14 places in 718 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:43:53] [INFO ] Deduced a trap composed of 38 places in 743 ms of which 33 ms to minimize.
[2025-06-06 18:43:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1771 ms
[2025-06-06 18:43:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 346 ms.
[2025-06-06 18:43:54] [INFO ] Added : 3 causal constraints over 1 iterations in 783 ms. Result :sat
Minimization took 4163 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:58] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:43:59] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2025-06-06 18:43:59] [INFO ] [Real]Added 283 Read/Feed constraints in 88 ms returned sat
[2025-06-06 18:43:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:43:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:44:00] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2025-06-06 18:44:01] [INFO ] [Nat]Added 283 Read/Feed constraints in 241 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:04] [INFO ] Deduced a trap composed of 19 places in 3079 ms of which 2307 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:05] [INFO ] Deduced a trap composed of 23 places in 704 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:05] [INFO ] Deduced a trap composed of 31 places in 372 ms of which 10 ms to minimize.
[2025-06-06 18:44:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4547 ms
[2025-06-06 18:44:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 344 ms.
[2025-06-06 18:44:06] [INFO ] Added : 4 causal constraints over 1 iterations in 786 ms. Result :sat
Minimization took 4065 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:44:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:44:11] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2025-06-06 18:44:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:44:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:44:12] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2025-06-06 18:44:12] [INFO ] [Nat]Added 283 Read/Feed constraints in 480 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:13] [INFO ] Deduced a trap composed of 18 places in 651 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:14] [INFO ] Deduced a trap composed of 23 places in 542 ms of which 19 ms to minimize.
[2025-06-06 18:44:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1496 ms
[2025-06-06 18:44:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 349 ms.
[2025-06-06 18:44:15] [INFO ] Added : 3 causal constraints over 1 iterations in 787 ms. Result :sat
Minimization took 4078 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:44:19] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:44:20] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2025-06-06 18:44:20] [INFO ] [Real]Added 283 Read/Feed constraints in 85 ms returned sat
[2025-06-06 18:44:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:44:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:44:21] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2025-06-06 18:44:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 138 ms returned sat
[2025-06-06 18:44:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 352 ms.
[2025-06-06 18:44:22] [INFO ] Added : 1 causal constraints over 1 iterations in 756 ms. Result :sat
Minimization took 3994 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:44:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:44:27] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2025-06-06 18:44:27] [INFO ] [Real]Added 283 Read/Feed constraints in 78 ms returned sat
[2025-06-06 18:44:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:44:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:44:28] [INFO ] [Nat]Absence check using state equation in 819 ms returned sat
[2025-06-06 18:44:28] [INFO ] [Nat]Added 283 Read/Feed constraints in 147 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:29] [INFO ] Deduced a trap composed of 36 places in 865 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:30] [INFO ] Deduced a trap composed of 47 places in 853 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:31] [INFO ] Deduced a trap composed of 48 places in 885 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:33] [INFO ] Deduced a trap composed of 37 places in 1193 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:34] [INFO ] Deduced a trap composed of 48 places in 901 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:35] [INFO ] Deduced a trap composed of 38 places in 922 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:44:36] [INFO ] Deduced a trap composed of 49 places in 1024 ms of which 37 ms to minimize.
[2025-06-06 18:44:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7682 ms
[2025-06-06 18:44:36] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 322 ms.
[2025-06-06 18:44:37] [INFO ] Added : 4 causal constraints over 1 iterations in 913 ms. Result :sat
Minimization took 4303 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
Support contains 11 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 107 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 110 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2025-06-06 18:44:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-06-06 18:44:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:44:44] [INFO ] Implicit Places using invariants in 1020 ms returned []
[2025-06-06 18:44:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-06-06 18:44:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:44:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-06-06 18:44:48] [INFO ] Implicit Places using invariants and state equation in 4803 ms returned []
Implicit Place search using SMT with State Equation took 5827 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:44:49] [INFO ] Redundant transitions in 826 ms returned []
Running 3870 sub problems to find dead transitions.
[2025-06-06 18:44:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-06-06 18:44:49] [INFO ] Invariant cache hit.
[2025-06-06 18:44:49] [INFO ] State equation strengthened by 283 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30233 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:45:55] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:45:55] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 8 ms to minimize.
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:45:59] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 8 ms to minimize.
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:45:59] [INFO ] Deduced a trap composed of 8 places in 388 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 12 constraints, problems are : Problem set: 356 solved, 3514 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3272/598 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70169ms problems are : Problem set: 356 solved, 3514 unsolved
Search for dead transitions found 356 dead transitions in 70223ms
Found 356 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 356 transitions
Dead transitions reduction (with SMT) removed 356 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3515/3871 transitions.
Reduce places removed 12 places and 453 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 257 transition count 3062
Reduce places removed 8 places and 254 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 249 transition count 2808
Reduce places removed 10 places and 290 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 30 place count 239 transition count 2518
Reduce places removed 5 places and 167 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 234 transition count 2351
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 48 place count 221 transition count 2325
Deduced a syphon composed of 4 places in 3 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 61 place count 221 transition count 2325
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 72 place count 210 transition count 2226
Deduced a syphon composed of 4 places in 4 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 83 place count 210 transition count 2226
Deduced a syphon composed of 4 places in 11 ms
Applied a total of 83 rules in 181 ms. Remains 210 /269 variables (removed 59) and now considering 2226/3515 (removed 1289) transitions.
[2025-06-06 18:46:00] [INFO ] Flow matrix only has 2079 transitions (discarded 147 similar events)
// Phase 1: matrix 2079 rows 210 cols
[2025-06-06 18:46:00] [INFO ] Computed 12 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:46:00] [INFO ] Implicit Places using invariants in 613 ms returned []
[2025-06-06 18:46:00] [INFO ] Flow matrix only has 2079 transitions (discarded 147 similar events)
[2025-06-06 18:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:46:01] [INFO ] State equation strengthened by 188 read => feed constraints.
[2025-06-06 18:46:03] [INFO ] Implicit Places using invariants and state equation in 2605 ms returned []
Implicit Place search using SMT with State Equation took 3221 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/269 places, 2226/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80445 ms. Remains : 210/269 places, 2226/3871 transitions.
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 18:46:03] [INFO ] Flow matrix only has 2079 transitions (discarded 147 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 1625=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {1=1, 1625=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 7) seen :[0, 1, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
[2025-06-06 18:46:04] [INFO ] Flow matrix only has 2079 transitions (discarded 147 similar events)
// Phase 1: matrix 2079 rows 206 cols
[2025-06-06 18:46:04] [INFO ] Computed 8 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000010 steps (2 resets) in 1016 ms. (983 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 14798 ms. (473 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:46:20] [INFO ] Flow matrix only has 2079 transitions (discarded 147 similar events)
[2025-06-06 18:46:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:20] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:46:21] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2025-06-06 18:46:21] [INFO ] State equation strengthened by 188 read => feed constraints.
[2025-06-06 18:46:21] [INFO ] [Real]Added 188 Read/Feed constraints in 65 ms returned sat
[2025-06-06 18:46:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:46:22] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2025-06-06 18:46:22] [INFO ] [Nat]Added 188 Read/Feed constraints in 210 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:22] [INFO ] Deduced a trap composed of 12 places in 633 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:23] [INFO ] Deduced a trap composed of 24 places in 417 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:24] [INFO ] Deduced a trap composed of 28 places in 528 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:24] [INFO ] Deduced a trap composed of 24 places in 389 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:25] [INFO ] Deduced a trap composed of 27 places in 544 ms of which 21 ms to minimize.
[2025-06-06 18:46:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2974 ms
[2025-06-06 18:46:25] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1619 transitions) in 213 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:26] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:26] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:27] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 25 ms to minimize.
[2025-06-06 18:46:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1358 ms
[2025-06-06 18:46:27] [INFO ] Added : 10 causal constraints over 4 iterations in 2328 ms. Result :sat
Minimization took 1472 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:46:29] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2025-06-06 18:46:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:46:30] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2025-06-06 18:46:30] [INFO ] [Nat]Added 188 Read/Feed constraints in 158 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:30] [INFO ] Deduced a trap composed of 10 places in 369 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:31] [INFO ] Deduced a trap composed of 21 places in 418 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:31] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 5 ms to minimize.
[2025-06-06 18:46:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1219 ms
[2025-06-06 18:46:31] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1619 transitions) in 163 ms.
[2025-06-06 18:46:32] [INFO ] Added : 9 causal constraints over 2 iterations in 531 ms. Result :sat
Minimization took 1366 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:33] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:46:34] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2025-06-06 18:46:34] [INFO ] [Real]Added 188 Read/Feed constraints in 56 ms returned sat
[2025-06-06 18:46:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:46:34] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2025-06-06 18:46:35] [INFO ] [Nat]Added 188 Read/Feed constraints in 252 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:35] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 6 ms to minimize.
[2025-06-06 18:46:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2025-06-06 18:46:35] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1619 transitions) in 170 ms.
[2025-06-06 18:46:36] [INFO ] Added : 11 causal constraints over 3 iterations in 657 ms. Result :sat
Minimization took 1375 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:37] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-06 18:46:37] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2025-06-06 18:46:38] [INFO ] [Real]Added 188 Read/Feed constraints in 46 ms returned sat
[2025-06-06 18:46:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:46:38] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2025-06-06 18:46:38] [INFO ] [Nat]Added 188 Read/Feed constraints in 91 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:39] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:39] [INFO ] Deduced a trap composed of 21 places in 443 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:40] [INFO ] Deduced a trap composed of 10 places in 353 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:40] [INFO ] Deduced a trap composed of 42 places in 364 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:40] [INFO ] Deduced a trap composed of 29 places in 360 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:41] [INFO ] Deduced a trap composed of 28 places in 532 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:41] [INFO ] Deduced a trap composed of 24 places in 368 ms of which 21 ms to minimize.
[2025-06-06 18:46:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3277 ms
[2025-06-06 18:46:42] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1619 transitions) in 175 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:43] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 22 ms to minimize.
[2025-06-06 18:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 584 ms
[2025-06-06 18:46:43] [INFO ] Added : 10 causal constraints over 4 iterations in 1404 ms. Result :sat
Minimization took 1450 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:45] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:46:45] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2025-06-06 18:46:45] [INFO ] [Real]Added 188 Read/Feed constraints in 42 ms returned sat
[2025-06-06 18:46:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-06 18:46:46] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2025-06-06 18:46:46] [INFO ] [Nat]Added 188 Read/Feed constraints in 166 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:46] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:47] [INFO ] Deduced a trap composed of 24 places in 369 ms of which 22 ms to minimize.
[2025-06-06 18:46:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 871 ms
[2025-06-06 18:46:47] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1619 transitions) in 171 ms.
[2025-06-06 18:46:47] [INFO ] Added : 6 causal constraints over 2 iterations in 500 ms. Result :sat
Minimization took 1384 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:46:49] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2025-06-06 18:46:49] [INFO ] [Real]Added 188 Read/Feed constraints in 64 ms returned sat
[2025-06-06 18:46:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:46:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:46:50] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2025-06-06 18:46:50] [INFO ] [Nat]Added 188 Read/Feed constraints in 238 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:51] [INFO ] Deduced a trap composed of 16 places in 410 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:51] [INFO ] Deduced a trap composed of 29 places in 471 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:52] [INFO ] Deduced a trap composed of 21 places in 410 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:52] [INFO ] Deduced a trap composed of 42 places in 478 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:53] [INFO ] Deduced a trap composed of 50 places in 488 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:53] [INFO ] Deduced a trap composed of 37 places in 432 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:54] [INFO ] Deduced a trap composed of 24 places in 459 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:55] [INFO ] Deduced a trap composed of 40 places in 471 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:55] [INFO ] Deduced a trap composed of 50 places in 476 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:56] [INFO ] Deduced a trap composed of 10 places in 421 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:56] [INFO ] Deduced a trap composed of 37 places in 437 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:57] [INFO ] Deduced a trap composed of 29 places in 462 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:58] [INFO ] Deduced a trap composed of 50 places in 590 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:58] [INFO ] Deduced a trap composed of 50 places in 435 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:59] [INFO ] Deduced a trap composed of 50 places in 425 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:46:59] [INFO ] Deduced a trap composed of 50 places in 479 ms of which 40 ms to minimize.
[2025-06-06 18:47:00] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9394 ms
[2025-06-06 18:47:00] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1619 transitions) in 177 ms.
[2025-06-06 18:47:00] [INFO ] Added : 16 causal constraints over 4 iterations in 689 ms. Result :sat
Minimization took 1456 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:47:02] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:47:02] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2025-06-06 18:47:03] [INFO ] [Real]Added 188 Read/Feed constraints in 45 ms returned sat
[2025-06-06 18:47:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:47:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 18:47:03] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2025-06-06 18:47:03] [INFO ] [Nat]Added 188 Read/Feed constraints in 104 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:47:04] [INFO ] Deduced a trap composed of 7 places in 385 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:47:04] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:47:05] [INFO ] Deduced a trap composed of 21 places in 347 ms of which 11 ms to minimize.
[2025-06-06 18:47:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1314 ms
[2025-06-06 18:47:05] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1619 transitions) in 168 ms.
[2025-06-06 18:47:05] [INFO ] Added : 6 causal constraints over 2 iterations in 518 ms. Result :sat
Minimization took 1381 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 7 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2226/2226 transitions.
Applied a total of 0 rules in 35 ms. Remains 206 /206 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 206/206 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2226/2226 transitions.
Applied a total of 0 rules in 50 ms. Remains 206 /206 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2025-06-06 18:47:08] [INFO ] Flow matrix only has 2079 transitions (discarded 147 similar events)
[2025-06-06 18:47:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:47:08] [INFO ] Implicit Places using invariants in 511 ms returned []
[2025-06-06 18:47:08] [INFO ] Flow matrix only has 2079 transitions (discarded 147 similar events)
[2025-06-06 18:47:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:47:09] [INFO ] State equation strengthened by 188 read => feed constraints.
[2025-06-06 18:47:10] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 2450 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:47:10] [INFO ] Redundant transitions in 198 ms returned []
Running 2225 sub problems to find dead transitions.
[2025-06-06 18:47:10] [INFO ] Flow matrix only has 2079 transitions (discarded 147 similar events)
[2025-06-06 18:47:10] [INFO ] Invariant cache hit.
[2025-06-06 18:47:10] [INFO ] State equation strengthened by 188 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:47:39] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:47:41] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/2285 variables, and 10 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/206 constraints, ReadFeed: 0/188 constraints, PredecessorRefiner: 2225/985 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 2/10 constraints. Problems are: Problem set: 12 solved, 2213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:47:57] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 6 ms to minimize.
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:01] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 6 ms to minimize.
Problem TDEAD1680 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:06] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 5 ms to minimize.
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 3/13 constraints. Problems are: Problem set: 368 solved, 1857 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 206/2285 variables, and 13 constraints, problems are : Problem set: 368 solved, 1857 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/206 constraints, ReadFeed: 0/188 constraints, PredecessorRefiner: 1240/985 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65103ms problems are : Problem set: 368 solved, 1857 unsolved
Search for dead transitions found 368 dead transitions in 65118ms
Found 368 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 368 transitions
Dead transitions reduction (with SMT) removed 368 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/206 places, 1858/2226 transitions.
Reduce places removed 15 places and 431 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 191 transition count 1427
Reduce places removed 14 places and 223 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 177 transition count 1204
Reduce places removed 8 places and 109 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 37 place count 169 transition count 1095
Reduce places removed 6 places and 31 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 43 place count 163 transition count 1064
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 45 place count 161 transition count 1018
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 46 place count 160 transition count 1002
Reduce places removed 0 places and 9 transitions.
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 55 place count 151 transition count 944
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 2 places and 32 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 66 place count 149 transition count 912
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 72 place count 143 transition count 840
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 78 place count 143 transition count 840
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 78 rules in 76 ms. Remains 143 /206 variables (removed 63) and now considering 840/1858 (removed 1018) transitions.
[2025-06-06 18:48:15] [INFO ] Flow matrix only has 747 transitions (discarded 93 similar events)
// Phase 1: matrix 747 rows 143 cols
[2025-06-06 18:48:15] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:48:16] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-06 18:48:16] [INFO ] Flow matrix only has 747 transitions (discarded 93 similar events)
[2025-06-06 18:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:48:16] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-06 18:48:17] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 143/206 places, 840/2226 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69535 ms. Remains : 143/206 places, 840/2226 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 18:48:17] [INFO ] Flow matrix only has 747 transitions (discarded 93 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 589=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 589=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :[0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:48:18] [INFO ] Flow matrix only has 747 transitions (discarded 93 similar events)
// Phase 1: matrix 747 rows 139 cols
[2025-06-06 18:48:18] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000076 steps (2 resets) in 561 ms. (1779 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 3310 ms. (906 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:48:22] [INFO ] Flow matrix only has 747 transitions (discarded 93 similar events)
[2025-06-06 18:48:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:48:22] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:48:22] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2025-06-06 18:48:22] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-06 18:48:22] [INFO ] [Real]Added 98 Read/Feed constraints in 27 ms returned sat
[2025-06-06 18:48:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:48:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:48:22] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2025-06-06 18:48:22] [INFO ] [Nat]Added 98 Read/Feed constraints in 47 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:23] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:23] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 10 ms to minimize.
[2025-06-06 18:48:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2025-06-06 18:48:23] [INFO ] Computed and/alt/rep : 302/1192/302 causal constraints (skipped 444 transitions) in 63 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:23] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 8 ms to minimize.
[2025-06-06 18:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2025-06-06 18:48:23] [INFO ] Added : 13 causal constraints over 3 iterations in 495 ms. Result :sat
Minimization took 363 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:48:24] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:48:24] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-06-06 18:48:24] [INFO ] [Real]Added 98 Read/Feed constraints in 30 ms returned sat
[2025-06-06 18:48:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:48:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 18:48:25] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2025-06-06 18:48:25] [INFO ] [Nat]Added 98 Read/Feed constraints in 55 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:25] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 9 ms to minimize.
[2025-06-06 18:48:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2025-06-06 18:48:25] [INFO ] Computed and/alt/rep : 302/1192/302 causal constraints (skipped 444 transitions) in 91 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:25] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:26] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 10 ms to minimize.
[2025-06-06 18:48:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2025-06-06 18:48:26] [INFO ] Added : 18 causal constraints over 5 iterations in 1020 ms. Result :sat
Minimization took 521 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:48:27] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:48:27] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2025-06-06 18:48:27] [INFO ] [Real]Added 98 Read/Feed constraints in 39 ms returned sat
[2025-06-06 18:48:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:48:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:48:27] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2025-06-06 18:48:27] [INFO ] [Nat]Added 98 Read/Feed constraints in 41 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:28] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 12 ms to minimize.
[2025-06-06 18:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2025-06-06 18:48:28] [INFO ] Computed and/alt/rep : 302/1192/302 causal constraints (skipped 444 transitions) in 68 ms.
[2025-06-06 18:48:28] [INFO ] Added : 2 causal constraints over 1 iterations in 188 ms. Result :sat
Minimization took 550 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 840/840 transitions.
Applied a total of 0 rules in 11 ms. Remains 139 /139 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 139/139 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 840/840 transitions.
Applied a total of 0 rules in 11 ms. Remains 139 /139 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2025-06-06 18:48:29] [INFO ] Flow matrix only has 747 transitions (discarded 93 similar events)
[2025-06-06 18:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:48:29] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-06-06 18:48:29] [INFO ] Flow matrix only has 747 transitions (discarded 93 similar events)
[2025-06-06 18:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:48:29] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-06 18:48:30] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:48:30] [INFO ] Redundant transitions in 10 ms returned []
Running 839 sub problems to find dead transitions.
[2025-06-06 18:48:30] [INFO ] Flow matrix only has 747 transitions (discarded 93 similar events)
[2025-06-06 18:48:30] [INFO ] Invariant cache hit.
[2025-06-06 18:48:30] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 839 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:36] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:48:36] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 4 ms to minimize.
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 2/10 constraints. Problems are: Problem set: 4 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 835 unsolved
At refinement iteration 3 (OVERLAPS) 747/886 variables, 139/149 constraints. Problems are: Problem set: 4 solved, 835 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 98/247 constraints. Problems are: Problem set: 4 solved, 835 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 247 constraints, problems are : Problem set: 4 solved, 835 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 139/139 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 839/839 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 835 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 2/10 constraints. Problems are: Problem set: 4 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 835 unsolved
At refinement iteration 3 (OVERLAPS) 747/886 variables, 139/149 constraints. Problems are: Problem set: 4 solved, 835 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 98/247 constraints. Problems are: Problem set: 4 solved, 835 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD832 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 835/1082 constraints. Problems are: Problem set: 124 solved, 715 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:49:28] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 4 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:49:31] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 7 ms to minimize.
SMT process timed out in 61050ms, After SMT, problems are : Problem set: 134 solved, 705 unsolved
Search for dead transitions found 134 dead transitions in 61054ms
Found 134 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 134 transitions
Dead transitions reduction (with SMT) removed 134 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 139/139 places, 706/840 transitions.
Graph (complete) has 1002 edges and 139 vertex of which 136 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 18 places and 210 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 118 transition count 496
Reduce places removed 4 places and 39 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 114 transition count 457
Reduce places removed 3 places and 26 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 111 transition count 431
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 109 transition count 415
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 108 transition count 410
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 32 place count 105 transition count 384
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 35 place count 105 transition count 384
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 35 rules in 26 ms. Remains 105 /139 variables (removed 34) and now considering 384/706 (removed 322) transitions.
[2025-06-06 18:49:31] [INFO ] Flow matrix only has 365 transitions (discarded 19 similar events)
// Phase 1: matrix 365 rows 105 cols
[2025-06-06 18:49:31] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:49:32] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-06 18:49:32] [INFO ] Flow matrix only has 365 transitions (discarded 19 similar events)
[2025-06-06 18:49:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:49:32] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-06 18:49:32] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 105/139 places, 384/840 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63813 ms. Remains : 105/139 places, 384/840 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 18:49:32] [INFO ] Flow matrix only has 365 transitions (discarded 19 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 13=1, 290=1, 345=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 290=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:49:33] [INFO ] Flow matrix only has 365 transitions (discarded 19 similar events)
// Phase 1: matrix 365 rows 103 cols
[2025-06-06 18:49:33] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000006 steps (2 resets) in 920 ms. (1085 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 796 ms. (1254 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:49:34] [INFO ] Flow matrix only has 365 transitions (discarded 19 similar events)
[2025-06-06 18:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:49:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-06 18:49:35] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-06-06 18:49:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-06 18:49:35] [INFO ] [Real]Added 65 Read/Feed constraints in 12 ms returned sat
[2025-06-06 18:49:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:49:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 18:49:35] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2025-06-06 18:49:35] [INFO ] [Nat]Added 65 Read/Feed constraints in 26 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:49:35] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:49:35] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:49:35] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:49:36] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 19 ms to minimize.
[2025-06-06 18:49:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 861 ms
[2025-06-06 18:49:36] [INFO ] Computed and/alt/rep : 222/1029/222 causal constraints (skipped 142 transitions) in 40 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:49:36] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 11 ms to minimize.
[2025-06-06 18:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2025-06-06 18:49:36] [INFO ] Added : 27 causal constraints over 6 iterations in 555 ms. Result :sat
Minimization took 187 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 384/384 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 103/103 places, 384/384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 384/384 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-06 18:49:37] [INFO ] Flow matrix only has 365 transitions (discarded 19 similar events)
[2025-06-06 18:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:49:37] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-06 18:49:37] [INFO ] Flow matrix only has 365 transitions (discarded 19 similar events)
[2025-06-06 18:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:49:37] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-06 18:49:37] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:49:37] [INFO ] Redundant transitions in 4 ms returned []
Running 383 sub problems to find dead transitions.
[2025-06-06 18:49:37] [INFO ] Flow matrix only has 365 transitions (discarded 19 similar events)
[2025-06-06 18:49:37] [INFO ] Invariant cache hit.
[2025-06-06 18:49:37] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 2 (OVERLAPS) 365/468 variables, 103/111 constraints. Problems are: Problem set: 4 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 65/176 constraints. Problems are: Problem set: 4 solved, 379 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:49:50] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/177 constraints. Problems are: Problem set: 4 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/177 constraints. Problems are: Problem set: 4 solved, 379 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 (/ 55.0 4.0))
(t1 (/ 39.0 8.0))
(t2 (/ 23.0 8.0))
(t3 (/ 43.0 4.0))
(t4 (/ 15.0 8.0))
(t5 (/ 23.0 8.0))
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 (/ 7.0 8.0))
(t11 3.0)
(t12 0.0)
(t13 (/ 7.0 8.0))
(t14 0.0)
(t15 0.0)
(t16 1.0)
(t17 1.0)
(t18 0.0)
(t19 (/ 47.0 8.0))
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 1.0)
(t26 0.0)
(t27 0.0)
(t28 (/ 7.0 8.0))timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 177 constraints, problems are : Problem set: 4 solved, 379 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 379 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 379 unsolved
At refinement iteration 3 (OVERLAPS) 365/468 variables, 103/112 constraints. Problems are: Problem set: 4 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 65/177 constraints. Problems are: Problem set: 4 solved, 379 unsolved
Problem TDEAD206 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 379/556 constraints. Problems are: Problem set: 6 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:50:19] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 1/557 constraints. Problems are: Problem set: 6 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:50:34] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:50:35] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 559 constraints, problems are : Problem set: 6 solved, 377 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 379/383 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 6 solved, 377 unsolved
Search for dead transitions found 6 dead transitions in 60424ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/103 places, 378/384 transitions.
Reduce places removed 1 places and 11 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 367
Applied a total of 1 rules in 9 ms. Remains 102 /103 variables (removed 1) and now considering 367/378 (removed 11) transitions.
[2025-06-06 18:50:38] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
// Phase 1: matrix 349 rows 102 cols
[2025-06-06 18:50:38] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:50:38] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-06 18:50:38] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
[2025-06-06 18:50:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:50:38] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-06 18:50:39] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 102/103 places, 367/384 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62493 ms. Remains : 102/103 places, 367/384 transitions.
[2025-06-06 18:50:39] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 13=1, 274=1, 333=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 274=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:50:39] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
[2025-06-06 18:50:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000097 steps (2 resets) in 816 ms. (1224 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 809 ms. (1234 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:50:41] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
[2025-06-06 18:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:50:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-06 18:50:41] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-06-06 18:50:41] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-06 18:50:41] [INFO ] [Real]Added 64 Read/Feed constraints in 14 ms returned sat
[2025-06-06 18:50:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:50:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-06 18:50:41] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-06-06 18:50:41] [INFO ] [Nat]Added 64 Read/Feed constraints in 17 ms returned sat
[2025-06-06 18:50:41] [INFO ] Computed and/alt/rep : 207/968/207 causal constraints (skipped 141 transitions) in 26 ms.
[2025-06-06 18:50:41] [INFO ] Added : 13 causal constraints over 5 iterations in 142 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 367/367 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 102/102 places, 367/367 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 367/367 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2025-06-06 18:50:42] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
[2025-06-06 18:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:50:42] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-06-06 18:50:42] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
[2025-06-06 18:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:50:42] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-06 18:50:43] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:50:43] [INFO ] Redundant transitions in 4 ms returned []
Running 366 sub problems to find dead transitions.
[2025-06-06 18:50:43] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
[2025-06-06 18:50:43] [INFO ] Invariant cache hit.
[2025-06-06 18:50:43] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
At refinement iteration 2 (OVERLAPS) 349/451 variables, 102/110 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 64/174 constraints. Problems are: Problem set: 80 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:50:51] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 1/175 constraints. Problems are: Problem set: 80 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:50:56] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 1/176 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/176 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/451 variables, 0/176 constraints. Problems are: Problem set: 80 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 176 constraints, problems are : Problem set: 80 solved, 286 unsolved in 29301 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 80 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 7/7 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/9 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 1/10 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 349/451 variables, 102/112 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 64/176 constraints. Problems are: Problem set: 80 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 286/462 constraints. Problems are: Problem set: 80 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:51:19] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:51:23] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:51:23] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:51:23] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 4/466 constraints. Problems are: Problem set: 80 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:51:28] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 1/467 constraints. Problems are: Problem set: 80 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 467 constraints, problems are : Problem set: 80 solved, 286 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 286/366 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59666ms problems are : Problem set: 80 solved, 286 unsolved
Search for dead transitions found 80 dead transitions in 59668ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/102 places, 287/367 transitions.
Graph (complete) has 517 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 97 transition count 277
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 97 transition count 277
Applied a total of 5 rules in 6 ms. Remains 97 /102 variables (removed 5) and now considering 277/287 (removed 10) transitions.
[2025-06-06 18:51:42] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
// Phase 1: matrix 257 rows 97 cols
[2025-06-06 18:51:42] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:51:43] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-06 18:51:43] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-06-06 18:51:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:51:43] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:51:43] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/102 places, 277/367 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61365 ms. Remains : 97/102 places, 277/367 transitions.
[2025-06-06 18:51:43] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:51:43] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-06-06 18:51:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000046 steps (2 resets) in 566 ms. (1763 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 770 ms. (1297 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:51:44] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-06-06 18:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:51:45] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-06 18:51:45] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-06 18:51:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:51:45] [INFO ] [Real]Added 55 Read/Feed constraints in 11 ms returned sat
[2025-06-06 18:51:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:51:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-06 18:51:45] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-06 18:51:45] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
[2025-06-06 18:51:45] [INFO ] Computed and/alt/rep : 216/1057/216 causal constraints (skipped 40 transitions) in 18 ms.
[2025-06-06 18:51:45] [INFO ] Added : 9 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2025-06-06 18:51:45] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-06-06 18:51:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:51:45] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-06 18:51:45] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-06-06 18:51:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:51:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:51:45] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:51:45] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2025-06-06 18:51:45] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-06-06 18:51:45] [INFO ] Invariant cache hit.
[2025-06-06 18:51:45] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 257/354 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 159 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 257/354 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 276/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:51:58] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:51:59] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:02] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:02] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:11] [INFO ] Deduced a trap along path composed of 6 places in 46 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/440 constraints. Problems are: Problem set: 5 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:19] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:19] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:19] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:20] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:20] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:20] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 447 constraints, problems are : Problem set: 5 solved, 271 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37270ms problems are : Problem set: 5 solved, 271 unsolved
Search for dead transitions found 5 dead transitions in 37271ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/97 places, 272/277 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:52:23] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37760 ms. Remains : 97/97 places, 272/277 transitions.
[2025-06-06 18:52:23] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {5=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:52:23] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
// Phase 1: matrix 252 rows 97 cols
[2025-06-06 18:52:23] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000093 steps (2 resets) in 508 ms. (1964 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 766 ms. (1303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-06-06 18:52:24] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:52:24] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-06 18:52:24] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-06 18:52:24] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:52:24] [INFO ] [Real]Added 55 Read/Feed constraints in 10 ms returned sat
[2025-06-06 18:52:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:52:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-06 18:52:24] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-06 18:52:24] [INFO ] [Nat]Added 55 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:25] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 6 ms to minimize.
[2025-06-06 18:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-06-06 18:52:25] [INFO ] Computed and/alt/rep : 217/1082/217 causal constraints (skipped 34 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:25] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:25] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 3 ms to minimize.
[2025-06-06 18:52:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2025-06-06 18:52:25] [INFO ] Added : 23 causal constraints over 7 iterations in 321 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2025-06-06 18:52:25] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:52:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:52:25] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-06 18:52:25] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:52:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:52:25] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:52:26] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:52:26] [INFO ] Redundant transitions in 1 ms returned []
Running 271 sub problems to find dead transitions.
[2025-06-06 18:52:26] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:52:26] [INFO ] Invariant cache hit.
[2025-06-06 18:52:26] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 13980 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:43] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:44] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:44] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:44] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:44] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:46] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 6/436 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:48] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:48] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:52:56] [INFO ] Deduced a trap along path composed of 6 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:02] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:02] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:03] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:03] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:09] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:09] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:09] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 446 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44076ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 44078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44604 ms. Remains : 97/97 places, 272/272 transitions.
[2025-06-06 18:53:10] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {5=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 40070 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 1/1 properties
[2025-06-06 18:53:10] [INFO ] Flatten gal took : 114 ms
[2025-06-06 18:53:10] [INFO ] Flatten gal took : 60 ms
[2025-06-06 18:53:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2464030389404975689.gal : 29 ms
[2025-06-06 18:53:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14098568633949701182.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2464030389404975689.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14098568633949701182.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14098568633949701182.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15092
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15092 after 48245
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48245 after 114422
Interrupted probabilistic random walk after 703003 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 1
Probabilistic random walk after 703003 steps, saw 427465 distinct states, run finished after 3033 ms. (steps per millisecond=231 ) properties seen :0
[2025-06-06 18:53:13] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:53:13] [INFO ] Invariant cache hit.
[2025-06-06 18:53:13] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 71/252 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/256 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/256 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 73/329 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/329 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 10/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/349 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/349 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/349 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 71/252 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 22/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/256 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/256 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 73/329 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:13] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/329 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/329 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/349 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/349 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/349 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:14] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/349 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/349 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/349 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 733ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 272/272 transitions.
RANDOM walk for 40384 steps (8 resets) in 49 ms. (807 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114422 after 246647
Interrupted probabilistic random walk after 751018 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 1
Probabilistic random walk after 751018 steps, saw 458749 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
[2025-06-06 18:53:17] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:53:17] [INFO ] Invariant cache hit.
[2025-06-06 18:53:17] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 71/252 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/256 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/256 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 73/329 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/329 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 10/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/349 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/349 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/349 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 71/252 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 22/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/256 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/256 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 73/329 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:17] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 6 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/329 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/329 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/349 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/349 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/349 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:18] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 10 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/349 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/349 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/349 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 962ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2025-06-06 18:53:18] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:53:18] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-06 18:53:18] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:53:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:53:18] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:53:18] [INFO ] Redundant transitions in 2 ms returned []
Running 271 sub problems to find dead transitions.
[2025-06-06 18:53:18] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:53:18] [INFO ] Invariant cache hit.
[2025-06-06 18:53:18] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :246647 after 510968
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 17553 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:40] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:41] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:41] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:41] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:44] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 6/436 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:46] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:46] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:53:56] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-06-06 18:54:00] [INFO ] Flatten gal took : 37 ms
[2025-06-06 18:54:00] [INFO ] Applying decomposition
[2025-06-06 18:54:00] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14291382039094054510.txt' '-o' '/tmp/graph14291382039094054510.bin' '-w' '/tmp/graph14291382039094054510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14291382039094054510.bin' '-l' '-1' '-v' '-w' '/tmp/graph14291382039094054510.weights' '-q' '0' '-e' '0.001'
[2025-06-06 18:54:01] [INFO ] Decomposing Gal with order
[2025-06-06 18:54:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 18:54:01] [INFO ] Removed a total of 5 redundant transitions.
[2025-06-06 18:54:01] [INFO ] Flatten gal took : 97 ms
[2025-06-06 18:54:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 4 ms.
[2025-06-06 18:54:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8255822585078997638.gal : 7 ms
[2025-06-06 18:54:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15526366533751528563.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8255822585078997638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15526366533751528563.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15526366533751528563.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 6642
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6642 after 15192
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :15192 after 22078
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :22078 after 65724
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:54:03] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :65724 after 215801
[2025-06-06 18:54:03] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:54:04] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:54:04] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 443 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47722ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 47724ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48244 ms. Remains : 97/97 places, 272/272 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 403 edges and 97 vertex of which 93 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 93 transition count 251
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 37 place count 78 transition count 179
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 78 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 78 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 77 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 77 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 76 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 76 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 76 transition count 172
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 69 place count 71 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 68 transition count 185
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 68 transition count 179
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 87 place count 62 transition count 179
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 62 transition count 179
Applied a total of 89 rules in 44 ms. Remains 62 /97 variables (removed 35) and now considering 179/272 (removed 93) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 179 rows 62 cols
[2025-06-06 18:54:06] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 18:54:06] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-06 18:54:06] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 18:54:06] [INFO ] After 102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-06 18:54:06] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :215801 after 410445
[2025-06-06 18:54:06] [INFO ] Flatten gal took : 18 ms
[2025-06-06 18:54:06] [INFO ] Flatten gal took : 18 ms
[2025-06-06 18:54:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality342210143164558124.gal : 3 ms
[2025-06-06 18:54:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6419087831321746459.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality342210143164558124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6419087831321746459.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality6419087831321746459.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15608
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15608 after 48761
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48761 after 114938
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114938 after 247163
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :410445 after 1.05102e+06
Detected timeout of ITS tools.
[2025-06-06 18:54:21] [INFO ] Flatten gal took : 15 ms
[2025-06-06 18:54:21] [INFO ] Applying decomposition
[2025-06-06 18:54:21] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4021731460874130797.txt' '-o' '/tmp/graph4021731460874130797.bin' '-w' '/tmp/graph4021731460874130797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4021731460874130797.bin' '-l' '-1' '-v' '-w' '/tmp/graph4021731460874130797.weights' '-q' '0' '-e' '0.001'
[2025-06-06 18:54:21] [INFO ] Decomposing Gal with order
[2025-06-06 18:54:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 18:54:21] [INFO ] Removed a total of 44 redundant transitions.
[2025-06-06 18:54:21] [INFO ] Flatten gal took : 20 ms
[2025-06-06 18:54:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 3 ms.
[2025-06-06 18:54:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5154961247823533657.gal : 4 ms
[2025-06-06 18:54:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15652446582740529865.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5154961247823533657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15652446582740529865.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15652446582740529865.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 157191
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :157191 after 1.19361e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.19361e+08 after 4.103e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.05102e+06 after 3.11141e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.103e+10 after 1.5617e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.5617e+13 after 4.20376e+15
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30449 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-06 18:54:36] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
// Phase 1: matrix 252 rows 97 cols
[2025-06-06 18:54:36] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10090 steps (2 resets) in 6 ms. (1441 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-06 18:54:36] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:54:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:54:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-06 18:54:37] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-06-06 18:54:37] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:54:37] [INFO ] [Real]Added 55 Read/Feed constraints in 10 ms returned sat
[2025-06-06 18:54:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 18:54:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-06 18:54:37] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-06 18:54:37] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:54:37] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 7 ms to minimize.
[2025-06-06 18:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-06-06 18:54:37] [INFO ] Computed and/alt/rep : 217/1082/217 causal constraints (skipped 34 transitions) in 17 ms.
[2025-06-06 18:54:37] [INFO ] Added : 9 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 97/97 places, 272/272 transitions.
[2025-06-06 18:54:37] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {5=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-06 18:54:37] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:54:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000117 steps (2 resets) in 551 ms. (1811 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 808 ms. (1236 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-06 18:54:39] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:54:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:54:39] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-06 18:54:39] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-06 18:54:39] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:54:39] [INFO ] [Real]Added 55 Read/Feed constraints in 10 ms returned sat
[2025-06-06 18:54:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:54:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-06 18:54:39] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-06-06 18:54:39] [INFO ] [Nat]Added 55 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:54:39] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 5 ms to minimize.
[2025-06-06 18:54:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2025-06-06 18:54:39] [INFO ] Computed and/alt/rep : 217/1082/217 causal constraints (skipped 34 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:54:39] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:54:39] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 3 ms to minimize.
[2025-06-06 18:54:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2025-06-06 18:54:40] [INFO ] Added : 23 causal constraints over 7 iterations in 377 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 97/97 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2025-06-06 18:54:40] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:54:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:54:40] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-06 18:54:40] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:54:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:54:40] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:54:41] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:54:41] [INFO ] Redundant transitions in 1 ms returned []
Running 271 sub problems to find dead transitions.
[2025-06-06 18:54:41] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:54:41] [INFO ] Invariant cache hit.
[2025-06-06 18:54:41] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 17174 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:02] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:03] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:03] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:03] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:03] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:06] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 6/436 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:08] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:08] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:16] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:22] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:22] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:23] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 443 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47279ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 47280ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48277 ms. Remains : 97/97 places, 272/272 transitions.
[2025-06-06 18:55:28] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {5=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-06 18:55:28] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:55:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000061 steps (2 resets) in 509 ms. (1960 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 862 ms. (1158 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-06 18:55:30] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:55:30] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-06 18:55:30] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-06 18:55:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:55:30] [INFO ] [Real]Added 55 Read/Feed constraints in 10 ms returned sat
[2025-06-06 18:55:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 18:55:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-06 18:55:30] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-06-06 18:55:30] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:30] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 5 ms to minimize.
[2025-06-06 18:55:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2025-06-06 18:55:30] [INFO ] Computed and/alt/rep : 217/1082/217 causal constraints (skipped 34 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:30] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:30] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 3 ms to minimize.
[2025-06-06 18:55:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2025-06-06 18:55:30] [INFO ] Added : 23 causal constraints over 7 iterations in 304 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2025-06-06 18:55:30] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:55:30] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-06 18:55:30] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:55:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:55:31] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:55:31] [INFO ] Redundant transitions in 2 ms returned []
Running 271 sub problems to find dead transitions.
[2025-06-06 18:55:31] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:55:31] [INFO ] Invariant cache hit.
[2025-06-06 18:55:31] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 13519 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:49] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:49] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:49] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:50] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:50] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:52] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 6/436 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:55] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:55:55] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:03] [INFO ] Deduced a trap along path composed of 6 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:09] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:10] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:10] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:10] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 443 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43617ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 43618ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44097 ms. Remains : 97/97 places, 272/272 transitions.
[2025-06-06 18:56:14] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {5=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-06 18:56:15] [INFO ] Flatten gal took : 22 ms
RANDOM walk for 40229 steps (8 resets) in 67 ms. (591 steps per ms) remains 1/1 properties
[2025-06-06 18:56:15] [INFO ] Flatten gal took : 21 ms
[2025-06-06 18:56:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3225575269501208377.gal : 5 ms
[2025-06-06 18:56:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13055575560299032240.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3225575269501208377.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13055575560299032240.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13055575560299032240.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15092
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15092 after 48245
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48245 after 114422
Interrupted probabilistic random walk after 698687 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 698687 steps, saw 424652 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
[2025-06-06 18:56:18] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:56:18] [INFO ] Invariant cache hit.
[2025-06-06 18:56:18] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 71/252 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/256 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/256 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 73/329 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/329 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 10/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/349 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/349 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/349 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 71/252 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 22/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/256 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/256 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 73/329 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:18] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/329 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/329 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/349 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/349 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/349 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:18] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/349 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/349 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/349 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 97/97 places, 272/272 transitions.
RANDOM walk for 40208 steps (8 resets) in 41 ms. (957 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114422 after 246647
Interrupted probabilistic random walk after 747476 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :0 out of 1
Probabilistic random walk after 747476 steps, saw 456443 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
[2025-06-06 18:56:21] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:56:21] [INFO ] Invariant cache hit.
[2025-06-06 18:56:21] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 71/252 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/256 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/256 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 73/329 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/329 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 10/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/349 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/349 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/349 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 71/252 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 22/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/256 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/256 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 73/329 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:22] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/329 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/329 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/349 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/349 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/349 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:22] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 6 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/349 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/349 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/349 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 723ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2025-06-06 18:56:22] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:56:22] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-06 18:56:22] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:56:22] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 18:56:23] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:56:23] [INFO ] Redundant transitions in 2 ms returned []
Running 271 sub problems to find dead transitions.
[2025-06-06 18:56:23] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2025-06-06 18:56:23] [INFO ] Invariant cache hit.
[2025-06-06 18:56:23] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :246647 after 510968
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 17563 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/349 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:44] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:45] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:45] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:45] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:47] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 6/436 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:49] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:49] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:56:57] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:57:03] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:57:03] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:57:04] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:57:04] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 6 ms to minimize.
Detected timeout of ITS tools.
[2025-06-06 18:57:05] [INFO ] Flatten gal took : 22 ms
[2025-06-06 18:57:05] [INFO ] Applying decomposition
[2025-06-06 18:57:05] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1493024429830397999.txt' '-o' '/tmp/graph1493024429830397999.bin' '-w' '/tmp/graph1493024429830397999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1493024429830397999.bin' '-l' '-1' '-v' '-w' '/tmp/graph1493024429830397999.weights' '-q' '0' '-e' '0.001'
[2025-06-06 18:57:05] [INFO ] Decomposing Gal with order
[2025-06-06 18:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 18:57:05] [INFO ] Removed a total of 5 redundant transitions.
[2025-06-06 18:57:05] [INFO ] Flatten gal took : 28 ms
[2025-06-06 18:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2025-06-06 18:57:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8636477116307987378.gal : 4 ms
[2025-06-06 18:57:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9311160525773884682.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8636477116307987378.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9311160525773884682.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9311160525773884682.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 1927
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1927 after 3211
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3211 after 9590
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9590 after 37122
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :37122 after 91846
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:57:10] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 18:57:10] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 12 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 445 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47664ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 47665ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48190 ms. Remains : 97/97 places, 272/272 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 403 edges and 97 vertex of which 93 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 93 transition count 251
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 37 place count 78 transition count 179
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 78 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 78 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 77 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 77 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 76 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 76 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 76 transition count 172
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 69 place count 71 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 68 transition count 185
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 68 transition count 179
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 87 place count 62 transition count 179
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 62 transition count 179
Applied a total of 89 rules in 35 ms. Remains 62 /97 variables (removed 35) and now considering 179/272 (removed 93) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 179 rows 62 cols
[2025-06-06 18:57:10] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 18:57:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-06 18:57:10] [INFO ] After 79ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 18:57:10] [INFO ] After 94ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-06 18:57:10] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2025-06-06 18:57:10] [INFO ] Flatten gal took : 13 ms
[2025-06-06 18:57:11] [INFO ] Flatten gal took : 11 ms
[2025-06-06 18:57:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7627476202690053346.gal : 2 ms
[2025-06-06 18:57:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15788787196818633029.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7627476202690053346.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15788787196818633029.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :91846 after 348349
Loading property file /tmp/ReachabilityCardinality15788787196818633029.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15608
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15608 after 48761
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48761 after 114938
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114938 after 247163
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :348349 after 934674
Detected timeout of ITS tools.
[2025-06-06 18:57:26] [INFO ] Flatten gal took : 11 ms
[2025-06-06 18:57:26] [INFO ] Applying decomposition
[2025-06-06 18:57:26] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5559391100851850276.txt' '-o' '/tmp/graph5559391100851850276.bin' '-w' '/tmp/graph5559391100851850276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5559391100851850276.bin' '-l' '-1' '-v' '-w' '/tmp/graph5559391100851850276.weights' '-q' '0' '-e' '0.001'
[2025-06-06 18:57:26] [INFO ] Decomposing Gal with order
[2025-06-06 18:57:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 18:57:26] [INFO ] Removed a total of 44 redundant transitions.
[2025-06-06 18:57:26] [INFO ] Flatten gal took : 15 ms
[2025-06-06 18:57:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 2 ms.
[2025-06-06 18:57:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8962281398208894012.gal : 2 ms
[2025-06-06 18:57:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17867731706744029592.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8962281398208894012.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17867731706744029592.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17867731706744029592.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 166424
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :166424 after 1.19361e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.19361e+08 after 4.103e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.103e+10 after 1.5617e+13
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :934674 after 2.04815e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.5617e+13 after 4.20156e+15
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30378 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-02 in 184233 ms.
[2025-06-06 18:57:41] [INFO ] Flatten gal took : 14 ms
[2025-06-06 18:57:41] [INFO ] Applying decomposition
[2025-06-06 18:57:41] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9597256042037678569.txt' '-o' '/tmp/graph9597256042037678569.bin' '-w' '/tmp/graph9597256042037678569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9597256042037678569.bin' '-l' '-1' '-v' '-w' '/tmp/graph9597256042037678569.weights' '-q' '0' '-e' '0.001'
[2025-06-06 18:57:41] [INFO ] Decomposing Gal with order
[2025-06-06 18:57:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 18:57:41] [INFO ] Removed a total of 5 redundant transitions.
[2025-06-06 18:57:41] [INFO ] Flatten gal took : 21 ms
[2025-06-06 18:57:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 1 ms.
[2025-06-06 18:57:41] [INFO ] Time to serialize gal into /tmp/UpperBounds15729597905271116775.gal : 4 ms
[2025-06-06 18:57:41] [INFO ] Time to serialize properties into /tmp/UpperBounds761073015479671542.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15729597905271116775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds761073015479671542.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds761073015479671542.prop.
Detected timeout of ITS tools.
[2025-06-06 19:23:15] [INFO ] Flatten gal took : 236 ms
[2025-06-06 19:23:15] [INFO ] Time to serialize gal into /tmp/UpperBounds5897424103790679792.gal : 44 ms
[2025-06-06 19:23:15] [INFO ] Time to serialize properties into /tmp/UpperBounds6135895552381934768.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5897424103790679792.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6135895552381934768.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds6135895552381934768.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m128, 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 r016-smll-174853765400597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m128.tgz
mv BugTracking-PT-q8m128 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.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 ;