About the Execution of ITS-Tools for PolyORBNT-COL-S10J20
| 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 | 1 4 10 2 1 1 4 ? 1 1 1 10 4 1 3 21 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254300597.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 PolyORBNT-COL-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254300597
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749062771057
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-04 18:46:12] [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-04 18:46:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 18:46:12] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-04 18:46:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-04 18:46:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 638 ms
[2025-06-04 18:46:12] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-04 18:46:12] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2025-06-04 18:46:13] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2025-06-04 18:46:13] [INFO ] Computed 13 invariants in 12 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 10, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 21] Max Struct:[+inf, 10, +inf, 2, 1, 1, 10, 10, +inf, +inf, +inf, 10, 4, 1, 3, 21]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 21 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-04 18:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:13] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-04 18:46:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:46:13] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:13] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 8 ms to minimize.
[2025-06-04 18:46: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-04 18:46:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:13] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:13] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:13] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
[2025-06-04 18:46:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 142 ms
[2025-06-04 18:46:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:13] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 22 ms to minimize.
[2025-06-04 18:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2025-06-04 18:46:13] [INFO ] Added : 36 causal constraints over 8 iterations in 201 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 18:46: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-04 18:46:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-04 18:46:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
[2025-06-04 18:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-04 18:46:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:14] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:14] [INFO ] Deduced a trap composed of 24 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-04 18:46:14] [INFO ] Deduced a trap composed of 24 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-04 18:46:14] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
[2025-06-04 18:46:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 165 ms
[2025-06-04 18:46:14] [INFO ] Added : 36 causal constraints over 8 iterations in 223 ms. Result :sat
Minimization took 169 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:14] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:14] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-04 18:46:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 18:46:14] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-04 18:46:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-04 18:46:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-04 18:46:14] [INFO ] Added : 20 causal constraints over 5 iterations in 142 ms. Result :sat
Minimization took 885 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:15] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 18:46:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 18:46:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 18:46:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 19 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:15] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:15] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
[2025-06-04 18:46:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2025-06-04 18:46:15] [INFO ] Added : 36 causal constraints over 8 iterations in 148 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 18:46:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 18:46:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 18:46:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 18:46:16] [INFO ] Added : 15 causal constraints over 3 iterations in 785 ms. Result :sat
Minimization took 178 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:16] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 18:46:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 18:46:16] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-04 18:46:16] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 18:46: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-04 18:46:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:16] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-04 18:46:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:17] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
[2025-06-04 18:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2025-06-04 18:46:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 18:46:17] [INFO ] Added : 21 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 313 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-04 18:46:17] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:17] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
[2025-06-04 18:46:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 18:46:17] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 18:46:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:17] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:17] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:17] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
[2025-06-04 18:46:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 131 ms
[2025-06-04 18:46:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 18:46:17] [INFO ] Added : 36 causal constraints over 8 iterations in 47 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:17] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 18:46:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 18:46:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-04 18:46:17] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 18:46:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 18:46:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-04 18:46:18] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-04 18:46:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 18:46:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 18:46:18] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 18:46:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:18] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
[2025-06-04 18:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-06-04 18:46:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-04 18:46:18] [INFO ] Added : 22 causal constraints over 5 iterations in 315 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:18] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
[2025-06-04 18:46:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 18:46:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:18] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 4 ms to minimize.
[2025-06-04 18:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2025-06-04 18:46:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 18:46:18] [INFO ] Added : 33 causal constraints over 7 iterations in 35 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:19] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 18:46:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 18:46:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-04 18:46:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 18:46:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 18:46:19] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-04 18:46:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 406 ms returned sat
[2025-06-04 18:46:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:19] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
[2025-06-04 18:46:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-04 18:46:19] [INFO ] Added : 20 causal constraints over 5 iterations in 76 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 10, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, 10, 10, 2, 1, 10, 10, +inf, +inf, 1, 10, 4, 1, 3]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-04 18:46:19] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 179 ms.
[2025-06-04 18:46:19] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 24 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
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 (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 10, 2, 1, 10, 10, +inf, +inf, 10, 4, 1, 3]
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, 10, 2, 1, 10, 10, +inf, +inf, 10, 4, 1, 3]
[2025-06-04 18:46:19] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2025-06-04 18:46:19] [INFO ] Computed 72 invariants in 78 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 10, 2, 1, 10, 10, 11, 11, 10, 4, 1, 3]
RANDOM walk for 10000 steps (561 resets) in 227 ms. (43 steps per ms)
FORMULA PolyORBNT-COL-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (940 resets) in 271 ms. (330 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[11, 10, 2, 10, 10, 11, 11, 4, 3]
[2025-06-04 18:46:20] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2025-06-04 18:46:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:20] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-04 18:46:20] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-04 18:46:21] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2025-06-04 18:46:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:46:21] [INFO ] [Real]Added 1 Read/Feed constraints in 21 ms returned sat
[2025-06-04 18:46:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:21] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-04 18:46:21] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 15 ms returned sat
[2025-06-04 18:46:21] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2025-06-04 18:46:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 160 ms returned sat
[2025-06-04 18:46:22] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 216 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:23] [INFO ] Deduced a trap composed of 19 places in 464 ms of which 33 ms to minimize.
[2025-06-04 18:46:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 685 ms
[2025-06-04 18:46:23] [INFO ] Added : 23 causal constraints over 5 iterations in 1479 ms. Result :sat
Minimization took 660 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:24] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-04 18:46:24] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:46:24] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-06-04 18:46:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-04 18:46:24] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:46:25] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2025-06-04 18:46:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 86 ms returned sat
[2025-06-04 18:46:25] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 356 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:26] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 20 ms to minimize.
[2025-06-04 18:46:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 618 ms
[2025-06-04 18:46:27] [INFO ] Added : 34 causal constraints over 8 iterations in 1880 ms. Result :sat
Minimization took 643 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:28] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-04 18:46:28] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-04 18:46:28] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2025-06-04 18:46:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 21 ms returned sat
[2025-06-04 18:46:28] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:46:30] [INFO ] [Nat]Absence check using state equation in 1727 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:30] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-04 18:46:30] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-04 18:46:31] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2025-06-04 18:46:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2025-06-04 18:46:31] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-04 18:46:31] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2025-06-04 18:46:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 359 ms returned sat
[2025-06-04 18:46:32] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 108 ms.
[2025-06-04 18:46:32] [INFO ] Added : 6 causal constraints over 2 iterations in 404 ms. Result :sat
Minimization took 633 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:33] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2025-06-04 18:46:33] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-04 18:46:33] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2025-06-04 18:46:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-04 18:46:33] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-04 18:46:34] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-06-04 18:46:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 183 ms returned sat
[2025-06-04 18:46:34] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 111 ms.
[2025-06-04 18:46:35] [INFO ] Added : 7 causal constraints over 2 iterations in 392 ms. Result :sat
Minimization took 655 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:35] [INFO ] [Real]Absence check using 65 positive place invariants in 28 ms returned sat
[2025-06-04 18:46:35] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-04 18:46:36] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2025-06-04 18:46:36] [INFO ] [Real]Added 1 Read/Feed constraints in 20 ms returned sat
[2025-06-04 18:46: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-04 18:46:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-04 18:46:36] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-04 18:46:36] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2025-06-04 18:46:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 156 ms returned sat
[2025-06-04 18:46:37] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 108 ms.
[2025-06-04 18:46:38] [INFO ] Added : 5 causal constraints over 1 iterations in 1183 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:38] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-04 18:46:38] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:38] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-04 18:46:38] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:46:38] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2025-06-04 18:46:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-04 18:46:39] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 19 ms returned sat
[2025-06-04 18:46:39] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2025-06-04 18:46:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2025-06-04 18:46:39] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 217 ms.
[2025-06-04 18:46:40] [INFO ] Added : 12 causal constraints over 3 iterations in 561 ms. Result :sat
Minimization took 665 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:40] [INFO ] [Real]Absence check using 65 positive place invariants in 27 ms returned sat
[2025-06-04 18:46:40] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-04 18:46:41] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2025-06-04 18:46:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:46:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2025-06-04 18:46:41] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-04 18:46:42] [INFO ] [Nat]Absence check using state equation in 1331 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[11, 10, 2, 10, 10, 11, 1, 4, 3]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 1, 1, 1, 0, 0] Max Struct:[11, 10, 2, 10, 10, 11, 4, 3]
Support contains 17 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 464 transition count 1627
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 57 place count 441 transition count 1626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 440 transition count 1626
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 58 place count 440 transition count 1602
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 106 place count 416 transition count 1602
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 415 transition count 1601
Applied a total of 108 rules in 269 ms. Remains 415 /474 variables (removed 59) and now considering 1601/1650 (removed 49) transitions.
Running 1590 sub problems to find dead transitions.
[2025-06-04 18:46:43] [INFO ] Flow matrix only has 1592 transitions (discarded 9 similar events)
// Phase 1: matrix 1592 rows 415 cols
[2025-06-04 18:46:43] [INFO ] Computed 62 invariants in 50 ms
[2025-06-04 18:46:43] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/2007 variables, and 52 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1590/589 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:10] [INFO ] Deduced a trap composed of 10 places in 496 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:26] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/2007 variables, and 55 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1001/589 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43247ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 43270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43560 ms. Remains : 415/474 places, 1601/1650 transitions.
[2025-06-04 18:47:26] [INFO ] Flow matrix only has 1592 transitions (discarded 9 similar events)
[2025-06-04 18:47:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 1, 1, 1, 0, 0] Max Struct:[11, 10, 2, 10, 10, 11, 4, 3]
RANDOM walk for 1000000 steps (68715 resets) in 13631 ms. (73 steps per ms)
FORMULA PolyORBNT-COL-S10J20-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000005 steps (44447 resets) in 11338 ms. (440 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 4, 3, 1] Max Struct:[11, 10, 10, 10, 11]
[2025-06-04 18:47:51] [INFO ] Flow matrix only has 1592 transitions (discarded 9 similar events)
[2025-06-04 18:47:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 18:47:51] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2025-06-04 18:47:51] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 18:47:51] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-04 18:47:51] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:47:51] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2025-06-04 18:47: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-04 18:47:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2025-06-04 18:47:52] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:47:53] [INFO ] [Nat]Absence check using state equation in 1211 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 18:47:53] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-04 18:47:53] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 18:47:53] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-04 18:47:53] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-04 18:47:53] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2025-06-04 18:47:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 18:47:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-04 18:47:53] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-04 18:47:54] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2025-06-04 18:47:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:47:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:54] [INFO ] Deduced a trap composed of 57 places in 421 ms of which 35 ms to minimize.
[2025-06-04 18:47:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 541 ms
[2025-06-04 18:47:55] [INFO ] Computed and/alt/rep : 1259/4773/1259 causal constraints (skipped 322 transitions) in 120 ms.
[2025-06-04 18:47:55] [INFO ] Added : 9 causal constraints over 3 iterations in 535 ms. Result :sat
Minimization took 1760 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 18:47:57] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-04 18:47:57] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 4, 3, 1] Max Struct:[1, 4, 4, 10, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1601/1601 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 415 transition count 1599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 413 transition count 1599
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 411 transition count 1597
Applied a total of 8 rules in 76 ms. Remains 411 /415 variables (removed 4) and now considering 1597/1601 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 411/415 places, 1597/1601 transitions.
[2025-06-04 18:47:57] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
// Phase 1: matrix 1588 rows 411 cols
[2025-06-04 18:47:57] [INFO ] Computed 62 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70461 resets) in 13390 ms. (74 steps per ms)
BEST_FIRST walk for 1000001 steps (9448 resets) in 2276 ms. (439 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-04 18:48:13] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-04 18:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 18:48:13] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-04 18:48:13] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-04 18:48:13] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2025-06-04 18:48: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-04 18:48:13] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2025-06-04 18:48:13] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-04 18:48:14] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2025-06-04 18:48:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:48:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 148 ms returned sat
[2025-06-04 18:48:14] [INFO ] Computed and/alt/rep : 1255/4766/1255 causal constraints (skipped 322 transitions) in 102 ms.
[2025-06-04 18:48:15] [INFO ] Added : 10 causal constraints over 3 iterations in 624 ms. Result :sat
Minimization took 3030 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1597/1597 transitions.
Applied a total of 0 rules in 38 ms. Remains 411 /411 variables (removed 0) and now considering 1597/1597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 411/411 places, 1597/1597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1597/1597 transitions.
Applied a total of 0 rules in 38 ms. Remains 411 /411 variables (removed 0) and now considering 1597/1597 (removed 0) transitions.
[2025-06-04 18:48:18] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-04 18:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:48:19] [INFO ] Implicit Places using invariants in 663 ms returned []
[2025-06-04 18:48:19] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-04 18:48:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:48:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:48:21] [INFO ] Implicit Places using invariants and state equation in 2640 ms returned []
Implicit Place search using SMT with State Equation took 3307 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:48:22] [INFO ] Redundant transitions in 87 ms returned []
Running 1586 sub problems to find dead transitions.
[2025-06-04 18:48:22] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-04 18:48:22] [INFO ] Invariant cache hit.
[2025-06-04 18:48:22] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 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 TDEAD388 is UNSAT
Problem TDEAD389 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 TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD618 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 TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
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 TDEAD1053 is UNSAT
Problem TDEAD1054 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 TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 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 TDEAD1073 is UNSAT
Problem TDEAD1074 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 TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1233 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 TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1286 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 TDEAD1308 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1360 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/410 variables, 9/61 constraints. Problems are: Problem set: 558 solved, 1028 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/61 constraints. Problems are: Problem set: 558 solved, 1028 unsolved
At refinement iteration 5 (OVERLAPS) 1/411 variables, 1/62 constraints. Problems are: Problem set: 558 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1999 variables, and 62 constraints, problems are : Problem set: 558 solved, 1028 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1586/585 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 558 solved, 1028 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 558 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 558 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:56] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:56] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:56] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/55 constraints. Problems are: Problem set: 558 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:13] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:15] [INFO ] Deduced a trap composed of 57 places in 199 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 2/57 constraints. Problems are: Problem set: 558 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:16] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1999 variables, and 58 constraints, problems are : Problem set: 558 solved, 1028 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 443/585 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62697ms problems are : Problem set: 558 solved, 1028 unsolved
Search for dead transitions found 558 dead transitions in 62703ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/411 places, 1039/1597 transitions.
Applied a total of 0 rules in 23 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:49:24] [INFO ] Redundant transitions in 38 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66222 ms. Remains : 411/411 places, 1039/1597 transitions.
[2025-06-04 18:49:24] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
// Phase 1: matrix 1030 rows 411 cols
[2025-06-04 18:49:24] [INFO ] Computed 62 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70236 resets) in 8594 ms. (116 steps per ms)
BEST_FIRST walk for 1000001 steps (9370 resets) in 1660 ms. (602 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-04 18:49:35] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 18:49:35] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2025-06-04 18:49:35] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:49:35] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2025-06-04 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-04 18:49:35] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2025-06-04 18:49:35] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:49:35] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-06-04 18:49:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:49:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 108 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:36] [INFO ] Deduced a trap composed of 148 places in 270 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:36] [INFO ] Deduced a trap composed of 148 places in 299 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:36] [INFO ] Deduced a trap composed of 148 places in 291 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:37] [INFO ] Deduced a trap composed of 148 places in 293 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:37] [INFO ] Deduced a trap composed of 148 places in 265 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:37] [INFO ] Deduced a trap composed of 148 places in 296 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:38] [INFO ] Deduced a trap composed of 148 places in 274 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:38] [INFO ] Deduced a trap composed of 148 places in 299 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:38] [INFO ] Deduced a trap composed of 148 places in 293 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:39] [INFO ] Deduced a trap composed of 148 places in 289 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:39] [INFO ] Deduced a trap composed of 149 places in 294 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:39] [INFO ] Deduced a trap composed of 148 places in 295 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:40] [INFO ] Deduced a trap composed of 148 places in 297 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:40] [INFO ] Deduced a trap composed of 148 places in 293 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:40] [INFO ] Deduced a trap composed of 148 places in 283 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:41] [INFO ] Deduced a trap composed of 148 places in 293 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:41] [INFO ] Deduced a trap composed of 148 places in 281 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:41] [INFO ] Deduced a trap composed of 148 places in 281 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:42] [INFO ] Deduced a trap composed of 148 places in 279 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:42] [INFO ] Deduced a trap composed of 148 places in 275 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:42] [INFO ] Deduced a trap composed of 148 places in 281 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:43] [INFO ] Deduced a trap composed of 148 places in 299 ms of which 38 ms to minimize.
[2025-06-04 18:49:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 7115 ms
[2025-06-04 18:49:43] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 7116 ms
[2025-06-04 18:49:43] [INFO ] Computed and/alt/rep : 697/2795/697 causal constraints (skipped 322 transitions) in 60 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:45] [INFO ] Deduced a trap composed of 126 places in 1468 ms of which 1199 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:46] [INFO ] Deduced a trap composed of 126 places in 1677 ms of which 1415 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:48] [INFO ] Deduced a trap composed of 126 places in 1261 ms of which 991 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:50] [INFO ] Deduced a trap composed of 126 places in 2080 ms of which 1822 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:51] [INFO ] Deduced a trap composed of 126 places in 800 ms of which 517 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:52] [INFO ] Deduced a trap composed of 126 places in 1261 ms of which 977 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:54] [INFO ] Deduced a trap composed of 126 places in 1239 ms of which 988 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:56] [INFO ] Deduced a trap composed of 126 places in 2215 ms of which 1967 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:57] [INFO ] Deduced a trap composed of 126 places in 1409 ms of which 1143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:58] [INFO ] Deduced a trap composed of 126 places in 950 ms of which 678 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:00] [INFO ] Deduced a trap composed of 126 places in 1468 ms of which 1206 ms to minimize.
[2025-06-04 18:50:00] [INFO ] Trap strengthening procedure interrupted after too many repetitions 16743 ms
[2025-06-04 18:50:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 16743 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:01] [INFO ] Deduced a trap composed of 126 places in 1471 ms of which 1216 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:03] [INFO ] Deduced a trap composed of 126 places in 1186 ms of which 919 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:04] [INFO ] Deduced a trap composed of 126 places in 1608 ms of which 1330 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:05] [INFO ] Deduced a trap composed of 126 places in 956 ms of which 701 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:06] [INFO ] Deduced a trap composed of 126 places in 842 ms of which 598 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:08] [INFO ] Deduced a trap composed of 126 places in 897 ms of which 634 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:09] [INFO ] Deduced a trap composed of 126 places in 1131 ms of which 880 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:10] [INFO ] Deduced a trap composed of 126 places in 871 ms of which 616 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:12] [INFO ] Deduced a trap composed of 126 places in 2125 ms of which 1873 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:13] [INFO ] Deduced a trap composed of 126 places in 839 ms of which 590 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:14] [INFO ] Deduced a trap composed of 126 places in 922 ms of which 668 ms to minimize.
[2025-06-04 18:50:14] [INFO ] Trap strengthening procedure interrupted after too many repetitions 13940 ms
[2025-06-04 18:50:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 13940 ms
[2025-06-04 18:50:14] [INFO ] Added : 16 causal constraints over 5 iterations in 31314 ms.(timeout) Result :sat
Minimization took 1264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 411/411 places, 1039/1039 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 15 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
[2025-06-04 18:50:15] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:50:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:50:16] [INFO ] Implicit Places using invariants in 878 ms returned []
[2025-06-04 18:50:16] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:50:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:50:18] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 2922 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:50:18] [INFO ] Redundant transitions in 13 ms returned []
Running 1028 sub problems to find dead transitions.
[2025-06-04 18:50:18] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:50:18] [INFO ] Invariant cache hit.
[2025-06-04 18:50:18] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:26] [INFO ] Deduced a trap composed of 102 places in 204 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:27] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:27] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:27] [INFO ] Deduced a trap composed of 102 places in 205 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:27] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:27] [INFO ] Deduced a trap composed of 102 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:28] [INFO ] Deduced a trap composed of 102 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:28] [INFO ] Deduced a trap composed of 102 places in 197 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:28] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:28] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:28] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:29] [INFO ] Deduced a trap composed of 102 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:29] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:29] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:29] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:29] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:30] [INFO ] Deduced a trap composed of 102 places in 190 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:30] [INFO ] Deduced a trap composed of 102 places in 186 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:30] [INFO ] Deduced a trap composed of 102 places in 194 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:30] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:31] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:31] [INFO ] Deduced a trap composed of 102 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:31] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:31] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:32] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:32] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:32] [INFO ] Deduced a trap composed of 102 places in 201 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:32] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:32] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:33] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:33] [INFO ] Deduced a trap composed of 102 places in 239 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:33] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:33] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:33] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:34] [INFO ] Deduced a trap composed of 102 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:34] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:34] [INFO ] Deduced a trap composed of 102 places in 210 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:34] [INFO ] Deduced a trap composed of 102 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:34] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:35] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:42] [INFO ] Deduced a trap composed of 102 places in 210 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:42] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:42] [INFO ] Deduced a trap composed of 102 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:42] [INFO ] Deduced a trap composed of 102 places in 203 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:42] [INFO ] Deduced a trap composed of 102 places in 194 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:43] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:43] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:43] [INFO ] Deduced a trap composed of 102 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:43] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:50] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 11 ms to minimize.
(s159 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 (/ 1.0 3.0))
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 (/ 1.0 3.0))
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 (/ 2.0 3.0))
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 (/ 2.0 3.0))
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 4.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 9.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1441 variables, and 102 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1028/586 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 50/102 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:51] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:52] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:52] [INFO ] Deduced a trap composed of 102 places in 331 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:53] [INFO ] Deduced a trap composed of 102 places in 263 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:53] [INFO ] Deduced a trap composed of 102 places in 276 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:53] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:54] [INFO ] Deduced a trap composed of 102 places in 308 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:54] [INFO ] Deduced a trap composed of 102 places in 303 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:54] [INFO ] Deduced a trap composed of 102 places in 309 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:55] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:55] [INFO ] Deduced a trap composed of 102 places in 289 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:55] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:56] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:56] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:56] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:56] [INFO ] Deduced a trap composed of 102 places in 282 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:57] [INFO ] Deduced a trap composed of 102 places in 273 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:57] [INFO ] Deduced a trap composed of 102 places in 273 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:57] [INFO ] Deduced a trap composed of 102 places in 247 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:58] [INFO ] Deduced a trap composed of 102 places in 265 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:58] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:58] [INFO ] Deduced a trap composed of 92 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:59] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:59] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:59] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:59] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:59] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:00] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:00] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:00] [INFO ] Deduced a trap composed of 92 places in 207 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:00] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:00] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:01] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:01] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:01] [INFO ] Deduced a trap composed of 92 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:01] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:01] [INFO ] Deduced a trap composed of 92 places in 198 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:02] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:02] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:02] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:04] [INFO ] Deduced a trap composed of 102 places in 294 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:04] [INFO ] Deduced a trap composed of 102 places in 275 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:04] [INFO ] Deduced a trap composed of 102 places in 306 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:04] [INFO ] Deduced a trap composed of 102 places in 288 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:05] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:05] [INFO ] Deduced a trap composed of 102 places in 298 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:05] [INFO ] Deduced a trap composed of 102 places in 320 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:06] [INFO ] Deduced a trap composed of 102 places in 330 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:06] [INFO ] Deduced a trap composed of 102 places in 318 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:06] [INFO ] Deduced a trap composed of 102 places in 312 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:07] [INFO ] Deduced a trap composed of 102 places in 300 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:07] [INFO ] Deduced a trap composed of 102 places in 308 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:07] [INFO ] Deduced a trap composed of 102 places in 321 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:08] [INFO ] Deduced a trap composed of 102 places in 313 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:08] [INFO ] Deduced a trap composed of 102 places in 318 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:08] [INFO ] Deduced a trap composed of 102 places in 316 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:09] [INFO ] Deduced a trap composed of 102 places in 309 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:09] [INFO ] Deduced a trap composed of 102 places in 326 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:09] [INFO ] Deduced a trap composed of 103 places in 303 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:10] [INFO ] Deduced a trap composed of 102 places in 315 ms of which 60 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:12] [INFO ] Deduced a trap composed of 102 places in 274 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:12] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:12] [INFO ] Deduced a trap composed of 102 places in 306 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:13] [INFO ] Deduced a trap composed of 102 places in 276 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:13] [INFO ] Deduced a trap composed of 102 places in 278 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:13] [INFO ] Deduced a trap composed of 102 places in 301 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:13] [INFO ] Deduced a trap composed of 102 places in 299 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:14] [INFO ] Deduced a trap composed of 102 places in 273 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:14] [INFO ] Deduced a trap composed of 102 places in 298 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:14] [INFO ] Deduced a trap composed of 102 places in 279 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:15] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:15] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:15] [INFO ] Deduced a trap composed of 102 places in 293 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:16] [INFO ] Deduced a trap composed of 102 places in 301 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:16] [INFO ] Deduced a trap composed of 102 places in 281 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:16] [INFO ] Deduced a trap composed of 102 places in 273 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:17] [INFO ] Deduced a trap composed of 102 places in 281 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:17] [INFO ] Deduced a trap composed of 102 places in 282 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:17] [INFO ] Deduced a trap composed of 102 places in 270 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:17] [INFO ] Deduced a trap composed of 102 places in 275 ms of which 33 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:19] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:19] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:20] [INFO ] Deduced a trap composed of 102 places in 193 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1441 variables, and 185 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/586 constraints, Known Traps: 133/133 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61394ms problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 61405ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64364 ms. Remains : 411/411 places, 1039/1039 transitions.
RANDOM walk for 40000 steps (2831 resets) in 1965 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (368 resets) in 414 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (389 resets) in 497 ms. (80 steps per ms) remains 2/2 properties
[2025-06-04 18:51:21] [INFO ] Flatten gal took : 742 ms
[2025-06-04 18:51:21] [INFO ] Flatten gal took : 261 ms
[2025-06-04 18:51:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4760400462699286394.gal : 78 ms
[2025-06-04 18:51:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13711358483990067421.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/ReachabilityCardinality4760400462699286394.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13711358483990067421.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/ReachabilityCardinality13711358483990067421.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
Interrupted probabilistic random walk after 270169 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 270169 steps, saw 44304 distinct states, run finished after 3005 ms. (steps per millisecond=89 ) properties seen :0
[2025-06-04 18:51:24] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:51:24] [INFO ] Invariant cache hit.
[2025-06-04 18:51:24] [INFO ] State equation strengthened by 1 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 128
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/410 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1030/1440 variables, 410/472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1440 variables, 1/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1440 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1441 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1441 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1441 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1441/1441 variables, and 474 constraints, problems are : Problem set: 1 solved, 1 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 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: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:25] [INFO ] Deduced a trap composed of 134 places in 337 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:25] [INFO ] Deduced a trap composed of 134 places in 300 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:26] [INFO ] Deduced a trap composed of 134 places in 272 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:26] [INFO ] Deduced a trap composed of 134 places in 313 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:26] [INFO ] Deduced a trap composed of 134 places in 231 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:26] [INFO ] Deduced a trap composed of 134 places in 215 ms of which 29 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 6/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/410 variables, 2/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:27] [INFO ] Deduced a trap composed of 148 places in 208 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:27] [INFO ] Deduced a trap composed of 148 places in 222 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:27] [INFO ] Deduced a trap composed of 148 places in 234 ms of which 28 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 3/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1030/1440 variables, 410/481 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1440 variables, 1/482 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:28] [INFO ] Deduced a trap composed of 146 places in 714 ms of which 481 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:29] [INFO ] Deduced a trap composed of 146 places in 651 ms of which 431 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:30] [INFO ] Deduced a trap composed of 146 places in 591 ms of which 349 ms to minimize.
SMT process timed out in 5958ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Running 1028 sub problems to find dead transitions.
[2025-06-04 18:51:30] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:51:30] [INFO ] Invariant cache hit.
[2025-06-04 18:51:30] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:38] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:38] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:39] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:39] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:39] [INFO ] Deduced a trap composed of 102 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:39] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:39] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:39] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:40] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:40] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:40] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:40] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:40] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :128 after 1024
[2025-06-04 18:51:41] [INFO ] Deduced a trap composed of 102 places in 208 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1024 after 2050
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2050 after 2053
[2025-06-04 18:51:41] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2053 after 2059
[2025-06-04 18:51:41] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2059 after 2070
[2025-06-04 18:51:41] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2070 after 2091
[2025-06-04 18:51:41] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:42] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:42] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:42] [INFO ] Deduced a trap composed of 102 places in 197 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:43] [INFO ] Deduced a trap composed of 102 places in 199 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:43] [INFO ] Deduced a trap composed of 102 places in 205 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:43] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:43] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:43] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2091 after 27142
[2025-06-04 18:51:44] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:44] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:44] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:44] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:44] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:45] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:45] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:45] [INFO ] Deduced a trap composed of 102 places in 194 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:45] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:45] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:46] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:46] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:46] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:46] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1441 variables, and 92 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1028/586 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:53] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 15 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :27142 after 179501
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:54] [INFO ] Deduced a trap composed of 102 places in 291 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:54] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:54] [INFO ] Deduced a trap composed of 102 places in 282 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:55] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:55] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:55] [INFO ] Deduced a trap composed of 102 places in 279 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:55] [INFO ] Deduced a trap composed of 102 places in 278 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:56] [INFO ] Deduced a trap composed of 102 places in 261 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:56] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:56] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:57] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:57] [INFO ] Deduced a trap composed of 102 places in 282 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:57] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:58] [INFO ] Deduced a trap composed of 102 places in 282 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:58] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:58] [INFO ] Deduced a trap composed of 102 places in 289 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:58] [INFO ] Deduced a trap composed of 102 places in 287 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:59] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:51:59] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
[2025-06-04 18:52:00] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 18 ms to minimize.
SDD size :179501 after 556054
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:00] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:00] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:00] [INFO ] Deduced a trap composed of 92 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:00] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:01] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:01] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:01] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:01] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:01] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:01] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:02] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:02] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:02] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:02] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:02] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:03] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:03] [INFO ] Deduced a trap composed of 92 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:03] [INFO ] Deduced a trap composed of 92 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:03] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:05] [INFO ] Deduced a trap composed of 102 places in 286 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:05] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:06] [INFO ] Deduced a trap composed of 102 places in 279 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:06] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:06] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:06] [INFO ] Deduced a trap composed of 102 places in 279 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:07] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:07] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:07] [INFO ] Deduced a trap composed of 102 places in 281 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:08] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:08] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:08] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:09] [INFO ] Deduced a trap composed of 103 places in 271 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:09] [INFO ] Deduced a trap composed of 103 places in 274 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:09] [INFO ] Deduced a trap composed of 103 places in 270 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:09] [INFO ] Deduced a trap composed of 103 places in 275 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:10] [INFO ] Deduced a trap composed of 103 places in 273 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:10] [INFO ] Deduced a trap composed of 103 places in 275 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:10] [INFO ] Deduced a trap composed of 103 places in 273 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:11] [INFO ] Deduced a trap composed of 103 places in 274 ms of which 33 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1441 variables, and 152 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/586 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41509ms problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 41518ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41545 ms. Remains : 411/411 places, 1039/1039 transitions.
Detected timeout of ITS tools.
RANDOM walk for 40000 steps (2828 resets) in 601 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (364 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
[2025-06-04 18:52:11] [INFO ] Flatten gal took : 138 ms
[2025-06-04 18:52:11] [INFO ] Applying decomposition
[2025-06-04 18:52:11] [INFO ] Flatten gal took : 82 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/graph13061753928678039360.txt' '-o' '/tmp/graph13061753928678039360.bin' '-w' '/tmp/graph13061753928678039360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13061753928678039360.bin' '-l' '-1' '-v' '-w' '/tmp/graph13061753928678039360.weights' '-q' '0' '-e' '0.001'
[2025-06-04 18:52:12] [INFO ] Decomposing Gal with order
[2025-06-04 18:52:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 18:52:12] [INFO ] Removed a total of 2994 redundant transitions.
[2025-06-04 18:52:12] [INFO ] Flatten gal took : 265 ms
[2025-06-04 18:52:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 127 ms.
[2025-06-04 18:52:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9268371200065824478.gal : 29 ms
[2025-06-04 18:52:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12468370899915005381.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/ReachabilityCardinality9268371200065824478.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12468370899915005381.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/ReachabilityCardinality12468370899915005381.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
Interrupted probabilistic random walk after 501032 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 501032 steps, saw 81620 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2025-06-04 18:52:14] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:52:14] [INFO ] Invariant cache hit.
[2025-06-04 18:52:14] [INFO ] State equation strengthened by 1 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/410 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1030/1440 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1440 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1440 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1441 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1441 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1441 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1441/1441 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:15] [INFO ] Deduced a trap composed of 134 places in 238 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:16] [INFO ] Deduced a trap composed of 134 places in 224 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:16] [INFO ] Deduced a trap composed of 134 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:16] [INFO ] Deduced a trap composed of 134 places in 220 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:16] [INFO ] Deduced a trap composed of 134 places in 212 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:17] [INFO ] Deduced a trap composed of 134 places in 215 ms of which 28 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/410 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:17] [INFO ] Deduced a trap composed of 148 places in 221 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:17] [INFO ] Deduced a trap composed of 148 places in 200 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:17] [INFO ] Deduced a trap composed of 148 places in 217 ms of which 29 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1030/1440 variables, 410/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1440 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:18] [INFO ] Deduced a trap composed of 146 places in 726 ms of which 489 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:19] [INFO ] Deduced a trap composed of 146 places in 662 ms of which 431 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:20] [INFO ] Deduced a trap composed of 146 places in 583 ms of which 353 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:20] [INFO ] Deduced a trap composed of 146 places in 550 ms of which 328 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:21] [INFO ] Deduced a trap composed of 146 places in 638 ms of which 406 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:22] [INFO ] Deduced a trap composed of 146 places in 1103 ms of which 873 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:23] [INFO ] Deduced a trap composed of 146 places in 995 ms of which 768 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:25] [INFO ] Deduced a trap composed of 146 places in 2040 ms of which 1806 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:27] [INFO ] Deduced a trap composed of 146 places in 1670 ms of which 1440 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:27] [INFO ] Deduced a trap composed of 146 places in 600 ms of which 371 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:29] [INFO ] Deduced a trap composed of 146 places in 1439 ms of which 1217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:30] [INFO ] Deduced a trap composed of 146 places in 801 ms of which 566 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:31] [INFO ] Deduced a trap composed of 146 places in 893 ms of which 668 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:35] [INFO ] Deduced a trap composed of 146 places in 4068 ms of which 3832 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:36] [INFO ] Deduced a trap composed of 146 places in 809 ms of which 574 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:38] [INFO ] Deduced a trap composed of 146 places in 1930 ms of which 1695 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:39] [INFO ] Deduced a trap composed of 146 places in 894 ms of which 662 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:39] [INFO ] Deduced a trap composed of 146 places in 877 ms of which 644 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:40] [INFO ] Deduced a trap composed of 146 places in 989 ms of which 756 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:42] [INFO ] Deduced a trap composed of 146 places in 1906 ms of which 1680 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1440 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:44] [INFO ] Deduced a trap composed of 146 places in 1702 ms of which 1470 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:46] [INFO ] Deduced a trap composed of 146 places in 2290 ms of which 2066 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:48] [INFO ] Deduced a trap composed of 146 places in 1082 ms of which 852 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:51] [INFO ] Deduced a trap composed of 146 places in 2930 ms of which 2696 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:53] [INFO ] Deduced a trap composed of 146 places in 2159 ms of which 1935 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:55] [INFO ] Deduced a trap composed of 146 places in 2629 ms of which 2410 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:56] [INFO ] Deduced a trap composed of 146 places in 809 ms of which 564 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:57] [INFO ] Deduced a trap composed of 146 places in 690 ms of which 452 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:52:59] [INFO ] Deduced a trap composed of 146 places in 1932 ms of which 1688 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-04 18:53:03] [INFO ] Deduced a trap composed of 146 places in 3768 ms of which 3523 ms to minimize.
SMT process timed out in 48331ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 411/411 places, 1039/1039 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 29 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
[2025-06-04 18:53:03] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:53:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:53:03] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-06-04 18:53:03] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:53:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:53:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:53:05] [INFO ] Implicit Places using invariants and state equation in 1949 ms returned []
Implicit Place search using SMT with State Equation took 2455 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:53:05] [INFO ] Redundant transitions in 15 ms returned []
Running 1028 sub problems to find dead transitions.
[2025-06-04 18:53:05] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:53:05] [INFO ] Invariant cache hit.
[2025-06-04 18:53:05] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:14] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:14] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:14] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:14] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:15] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:15] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:15] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:15] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:15] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:15] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:16] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:16] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:16] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:16] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:16] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:17] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:17] [INFO ] Deduced a trap composed of 102 places in 193 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:17] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:17] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:17] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:18] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:18] [INFO ] Deduced a trap composed of 102 places in 192 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:18] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:19] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:19] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:19] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:19] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:19] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:20] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:20] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:20] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:20] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:20] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:21] [INFO ] Deduced a trap composed of 102 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:21] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:21] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:21] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:21] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:22] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:22] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:29] [INFO ] Deduced a trap composed of 102 places in 185 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:29] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:29] [INFO ] Deduced a trap composed of 102 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:29] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:30] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:30] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:30] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:30] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:30] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:37] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 10 ms to minimize.
SMT process timed out in 31547ms, After SMT, problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 31550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34062 ms. Remains : 411/411 places, 1039/1039 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2025-06-04 18:53:37] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:53:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (734 resets) in 88 ms. (112 steps per ms)
BEST_FIRST walk for 10001 steps (95 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-04 18:53:37] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:53:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 18:53:37] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-04 18:53:37] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-04 18:53:37] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-06-04 18:53: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-04 18:53:37] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-04 18:53:37] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-04 18:53:38] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-06-04 18:53:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:53:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 106 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:38] [INFO ] Deduced a trap composed of 148 places in 278 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:38] [INFO ] Deduced a trap composed of 148 places in 279 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:39] [INFO ] Deduced a trap composed of 148 places in 268 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:39] [INFO ] Deduced a trap composed of 148 places in 289 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:39] [INFO ] Deduced a trap composed of 148 places in 287 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:40] [INFO ] Deduced a trap composed of 148 places in 280 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:40] [INFO ] Deduced a trap composed of 148 places in 289 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:40] [INFO ] Deduced a trap composed of 148 places in 297 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:41] [INFO ] Deduced a trap composed of 148 places in 295 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:41] [INFO ] Deduced a trap composed of 148 places in 296 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:41] [INFO ] Deduced a trap composed of 149 places in 274 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:42] [INFO ] Deduced a trap composed of 148 places in 299 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:42] [INFO ] Deduced a trap composed of 148 places in 280 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:42] [INFO ] Deduced a trap composed of 148 places in 296 ms of which 38 ms to minimize.
[2025-06-04 18:53:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:946)
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:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 22 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Running 1028 sub problems to find dead transitions.
[2025-06-04 18:53:42] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:53:42] [INFO ] Invariant cache hit.
[2025-06-04 18:53:42] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:51] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:51] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:51] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:51] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:52] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:52] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:52] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:52] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:52] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:53] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:53] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:53] [INFO ] Deduced a trap composed of 102 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:53] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:53] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:54] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:54] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:54] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:54] [INFO ] Deduced a trap composed of 102 places in 186 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:54] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:55] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:55] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:55] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:55] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:56] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:56] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:56] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:56] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:56] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:57] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:57] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:57] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:57] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:57] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:58] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:58] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:58] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:58] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:58] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:58] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:53:59] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 20 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1441 variables, and 92 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1028/586 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:05] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:06] [INFO ] Deduced a trap composed of 102 places in 297 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:07] [INFO ] Deduced a trap composed of 102 places in 302 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:07] [INFO ] Deduced a trap composed of 102 places in 271 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:07] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:07] [INFO ] Deduced a trap composed of 102 places in 269 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:08] [INFO ] Deduced a trap composed of 102 places in 287 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:08] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:08] [INFO ] Deduced a trap composed of 102 places in 294 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:09] [INFO ] Deduced a trap composed of 102 places in 295 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:09] [INFO ] Deduced a trap composed of 102 places in 296 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:09] [INFO ] Deduced a trap composed of 102 places in 300 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:10] [INFO ] Deduced a trap composed of 102 places in 270 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:10] [INFO ] Deduced a trap composed of 102 places in 300 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:10] [INFO ] Deduced a trap composed of 102 places in 273 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:11] [INFO ] Deduced a trap composed of 102 places in 303 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:11] [INFO ] Deduced a trap composed of 102 places in 294 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:11] [INFO ] Deduced a trap composed of 102 places in 291 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:11] [INFO ] Deduced a trap composed of 102 places in 275 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:12] [INFO ] Deduced a trap composed of 102 places in 294 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:12] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:13] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:13] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:13] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:13] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:13] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:13] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:14] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:14] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:14] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:14] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:14] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:15] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:15] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:15] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:15] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:15] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:16] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:16] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:16] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:18] [INFO ] Deduced a trap composed of 102 places in 279 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:18] [INFO ] Deduced a trap composed of 102 places in 273 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:18] [INFO ] Deduced a trap composed of 102 places in 293 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:18] [INFO ] Deduced a trap composed of 102 places in 272 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:19] [INFO ] Deduced a trap composed of 102 places in 292 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:19] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:19] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:20] [INFO ] Deduced a trap composed of 102 places in 279 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:20] [INFO ] Deduced a trap composed of 102 places in 288 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:20] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:21] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:21] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:21] [INFO ] Deduced a trap composed of 103 places in 262 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:22] [INFO ] Deduced a trap composed of 103 places in 265 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:22] [INFO ] Deduced a trap composed of 103 places in 281 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:22] [INFO ] Deduced a trap composed of 103 places in 281 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:22] [INFO ] Deduced a trap composed of 103 places in 261 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:23] [INFO ] Deduced a trap composed of 103 places in 280 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:23] [INFO ] Deduced a trap composed of 103 places in 280 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:23] [INFO ] Deduced a trap composed of 103 places in 288 ms of which 34 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1441 variables, and 152 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/586 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41354ms problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 41356ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41381 ms. Remains : 411/411 places, 1039/1039 transitions.
[2025-06-04 18:54:24] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:54:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70498 resets) in 8518 ms. (117 steps per ms)
BEST_FIRST walk for 1000001 steps (9569 resets) in 1639 ms. (609 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-04 18:54:34] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:54:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 18:54:34] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-04 18:54:34] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:54:34] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2025-06-04 18:54: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-04 18:54:34] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2025-06-04 18:54:34] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 18:54:35] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2025-06-04 18:54:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:54:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 102 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:35] [INFO ] Deduced a trap composed of 148 places in 278 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:35] [INFO ] Deduced a trap composed of 148 places in 296 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:36] [INFO ] Deduced a trap composed of 148 places in 284 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:36] [INFO ] Deduced a trap composed of 148 places in 288 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:36] [INFO ] Deduced a trap composed of 148 places in 265 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:37] [INFO ] Deduced a trap composed of 148 places in 295 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:37] [INFO ] Deduced a trap composed of 148 places in 289 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:37] [INFO ] Deduced a trap composed of 148 places in 269 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:38] [INFO ] Deduced a trap composed of 148 places in 291 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:38] [INFO ] Deduced a trap composed of 148 places in 293 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:38] [INFO ] Deduced a trap composed of 149 places in 294 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:39] [INFO ] Deduced a trap composed of 148 places in 268 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:39] [INFO ] Deduced a trap composed of 148 places in 265 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:39] [INFO ] Deduced a trap composed of 148 places in 290 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:40] [INFO ] Deduced a trap composed of 148 places in 268 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:40] [INFO ] Deduced a trap composed of 148 places in 270 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:40] [INFO ] Deduced a trap composed of 148 places in 270 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:40] [INFO ] Deduced a trap composed of 148 places in 268 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:41] [INFO ] Deduced a trap composed of 148 places in 262 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:41] [INFO ] Deduced a trap composed of 148 places in 265 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:41] [INFO ] Deduced a trap composed of 148 places in 269 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:42] [INFO ] Deduced a trap composed of 148 places in 272 ms of which 37 ms to minimize.
[2025-06-04 18:54:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6938 ms
[2025-06-04 18:54:42] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6938 ms
[2025-06-04 18:54:42] [INFO ] Computed and/alt/rep : 697/2795/697 causal constraints (skipped 322 transitions) in 62 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:44] [INFO ] Deduced a trap composed of 126 places in 1459 ms of which 1176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:45] [INFO ] Deduced a trap composed of 126 places in 1652 ms of which 1401 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:47] [INFO ] Deduced a trap composed of 126 places in 1263 ms of which 991 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:49] [INFO ] Deduced a trap composed of 126 places in 2062 ms of which 1797 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:50] [INFO ] Deduced a trap composed of 126 places in 773 ms of which 505 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:51] [INFO ] Deduced a trap composed of 126 places in 1253 ms of which 973 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:53] [INFO ] Deduced a trap composed of 126 places in 1237 ms of which 966 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:55] [INFO ] Deduced a trap composed of 126 places in 2220 ms of which 1945 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:56] [INFO ] Deduced a trap composed of 126 places in 1404 ms of which 1131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:57] [INFO ] Deduced a trap composed of 126 places in 937 ms of which 672 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:54:59] [INFO ] Deduced a trap composed of 126 places in 1454 ms of which 1184 ms to minimize.
[2025-06-04 18:54:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 16649 ms
[2025-06-04 18:54:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 16649 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:00] [INFO ] Deduced a trap composed of 126 places in 1453 ms of which 1183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:02] [INFO ] Deduced a trap composed of 126 places in 1177 ms of which 905 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:03] [INFO ] Deduced a trap composed of 126 places in 1606 ms of which 1334 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:04] [INFO ] Deduced a trap composed of 126 places in 975 ms of which 707 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:05] [INFO ] Deduced a trap composed of 126 places in 882 ms of which 597 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:07] [INFO ] Deduced a trap composed of 126 places in 906 ms of which 638 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:08] [INFO ] Deduced a trap composed of 126 places in 1147 ms of which 877 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:09] [INFO ] Deduced a trap composed of 126 places in 891 ms of which 620 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:11] [INFO ] Deduced a trap composed of 126 places in 2132 ms of which 1871 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:12] [INFO ] Deduced a trap composed of 126 places in 842 ms of which 587 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:13] [INFO ] Deduced a trap composed of 126 places in 946 ms of which 675 ms to minimize.
[2025-06-04 18:55:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 14098 ms
[2025-06-04 18:55:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 14098 ms
[2025-06-04 18:55:13] [INFO ] Added : 16 causal constraints over 5 iterations in 31440 ms.(timeout) Result :sat
Minimization took 1279 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 411/411 places, 1039/1039 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 14 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
[2025-06-04 18:55:14] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:55:15] [INFO ] Implicit Places using invariants in 518 ms returned []
[2025-06-04 18:55:15] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:55:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:55:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:55:17] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2437 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:55:17] [INFO ] Redundant transitions in 13 ms returned []
Running 1028 sub problems to find dead transitions.
[2025-06-04 18:55:17] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:55:17] [INFO ] Invariant cache hit.
[2025-06-04 18:55:17] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:25] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:26] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:26] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:26] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:26] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:26] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:27] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:27] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:27] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:27] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:27] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:27] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:28] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:28] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:28] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:28] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:28] [INFO ] Deduced a trap composed of 102 places in 190 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:29] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:29] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:29] [INFO ] Deduced a trap composed of 102 places in 186 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:29] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:30] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:30] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:30] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:30] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:31] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:31] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:31] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:31] [INFO ] Deduced a trap composed of 102 places in 185 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:31] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:31] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:32] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:32] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:32] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:32] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:32] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:33] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:33] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:33] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:33] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:40] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:41] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:41] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:41] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:41] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:41] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:42] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:42] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:42] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1441 variables, and 101 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1028/586 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:50] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:51] [INFO ] Deduced a trap composed of 102 places in 295 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:51] [INFO ] Deduced a trap composed of 102 places in 291 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:51] [INFO ] Deduced a trap composed of 102 places in 295 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:52] [INFO ] Deduced a trap composed of 102 places in 271 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:52] [INFO ] Deduced a trap composed of 102 places in 286 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:52] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:53] [INFO ] Deduced a trap composed of 102 places in 288 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:53] [INFO ] Deduced a trap composed of 102 places in 287 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:53] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:53] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:54] [INFO ] Deduced a trap composed of 102 places in 296 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:54] [INFO ] Deduced a trap composed of 102 places in 289 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:54] [INFO ] Deduced a trap composed of 102 places in 272 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:55] [INFO ] Deduced a trap composed of 102 places in 277 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:55] [INFO ] Deduced a trap composed of 102 places in 275 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:56] [INFO ] Deduced a trap composed of 102 places in 296 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:56] [INFO ] Deduced a trap composed of 102 places in 286 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:56] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:56] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:58] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:58] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:58] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:59] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:59] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:59] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:59] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:55:59] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:00] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:00] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:00] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:00] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:00] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:00] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:01] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:01] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:01] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:01] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:01] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:02] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:02] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:03] [INFO ] Deduced a trap composed of 102 places in 332 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:03] [INFO ] Deduced a trap composed of 102 places in 291 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:03] [INFO ] Deduced a trap composed of 102 places in 293 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:04] [INFO ] Deduced a trap composed of 102 places in 332 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:04] [INFO ] Deduced a trap composed of 102 places in 274 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:04] [INFO ] Deduced a trap composed of 102 places in 263 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:05] [INFO ] Deduced a trap composed of 102 places in 265 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:05] [INFO ] Deduced a trap composed of 102 places in 260 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:05] [INFO ] Deduced a trap composed of 102 places in 257 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:05] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:06] [INFO ] Deduced a trap composed of 102 places in 287 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:06] [INFO ] Deduced a trap composed of 102 places in 281 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:06] [INFO ] Deduced a trap composed of 102 places in 290 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:07] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:07] [INFO ] Deduced a trap composed of 102 places in 260 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:07] [INFO ] Deduced a trap composed of 102 places in 294 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:08] [INFO ] Deduced a trap composed of 102 places in 294 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:08] [INFO ] Deduced a trap composed of 97 places in 286 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:08] [INFO ] Deduced a trap composed of 102 places in 290 ms of which 33 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:09] [INFO ] Deduced a trap composed of 96 places in 288 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:10] [INFO ] Deduced a trap composed of 92 places in 277 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:10] [INFO ] Deduced a trap composed of 93 places in 294 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:10] [INFO ] Deduced a trap composed of 102 places in 297 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:11] [INFO ] Deduced a trap composed of 102 places in 296 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:11] [INFO ] Deduced a trap composed of 102 places in 293 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:11] [INFO ] Deduced a trap composed of 102 places in 291 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:12] [INFO ] Deduced a trap composed of 102 places in 298 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:12] [INFO ] Deduced a trap composed of 102 places in 320 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:12] [INFO ] Deduced a trap composed of 102 places in 291 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:14] [INFO ] Deduced a trap composed of 93 places in 262 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:14] [INFO ] Deduced a trap composed of 93 places in 286 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:15] [INFO ] Deduced a trap composed of 93 places in 287 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:15] [INFO ] Deduced a trap composed of 93 places in 260 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:15] [INFO ] Deduced a trap composed of 87 places in 295 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:16] [INFO ] Deduced a trap composed of 87 places in 294 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:16] [INFO ] Deduced a trap composed of 93 places in 288 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:16] [INFO ] Deduced a trap composed of 93 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:16] [INFO ] Deduced a trap composed of 93 places in 287 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:17] [INFO ] Deduced a trap composed of 93 places in 284 ms of which 33 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1441 variables, and 181 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/586 constraints, Known Traps: 129/129 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61351ms problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 61354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63827 ms. Remains : 411/411 places, 1039/1039 transitions.
[2025-06-04 18:56:18] [INFO ] Flatten gal took : 63 ms
[2025-06-04 18:56:18] [INFO ] Flatten gal took : 63 ms
[2025-06-04 18:56:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18274147561273063715.gal : 13 ms
[2025-06-04 18:56:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3482871697661328271.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/ReachabilityCardinality18274147561273063715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3482871697661328271.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
RANDOM walk for 40000 steps (2836 resets) in 770 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (381 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (375 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3482871697661328271.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 128
Interrupted probabilistic random walk after 444753 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 2
Probabilistic random walk after 444753 steps, saw 72562 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2025-06-04 18:56:22] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:56:22] [INFO ] Invariant cache hit.
[2025-06-04 18:56:22] [INFO ] State equation strengthened by 1 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/410 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1030/1440 variables, 410/472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1440 variables, 1/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1440 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1441 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1441 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1441 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1441/1441 variables, and 474 constraints, problems are : Problem set: 1 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 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: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:22] [INFO ] Deduced a trap composed of 134 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:23] [INFO ] Deduced a trap composed of 134 places in 229 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:23] [INFO ] Deduced a trap composed of 134 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:23] [INFO ] Deduced a trap composed of 134 places in 229 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:23] [INFO ] Deduced a trap composed of 134 places in 230 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:24] [INFO ] Deduced a trap composed of 134 places in 224 ms of which 28 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 6/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/410 variables, 2/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:24] [INFO ] Deduced a trap composed of 148 places in 229 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:24] [INFO ] Deduced a trap composed of 148 places in 216 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:24] [INFO ] Deduced a trap composed of 148 places in 222 ms of which 28 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 3/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1030/1440 variables, 410/481 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1440 variables, 1/482 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:25] [INFO ] Deduced a trap composed of 146 places in 718 ms of which 484 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:26] [INFO ] Deduced a trap composed of 146 places in 668 ms of which 427 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:27] [INFO ] Deduced a trap composed of 146 places in 588 ms of which 350 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:27] [INFO ] Deduced a trap composed of 146 places in 563 ms of which 323 ms to minimize.
SMT process timed out in 5768ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 31 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Running 1028 sub problems to find dead transitions.
[2025-06-04 18:56:27] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:56:27] [INFO ] Invariant cache hit.
[2025-06-04 18:56:27] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:36] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:36] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:36] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:37] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:37] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:37] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:37] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:37] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:37] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:38] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:38] [INFO ] Deduced a trap composed of 102 places in 232 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:38] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:38] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:39] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:39] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:39] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:39] [INFO ] Deduced a trap composed of 102 places in 186 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:39] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:40] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:40] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:40] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:40] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:41] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:41] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :128 after 1024
[2025-06-04 18:56:41] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1024 after 2050
[2025-06-04 18:56:41] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2050 after 2053
[2025-06-04 18:56:41] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2053 after 2059
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:42] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2059 after 2070
[2025-06-04 18:56:42] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:42] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2070 after 2091
[2025-06-04 18:56:42] [INFO ] Deduced a trap composed of 102 places in 185 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:42] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:43] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:43] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:43] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:43] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:43] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:44] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:44] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:44] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2091 after 27142
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1441 variables, and 92 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1028/586 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:51] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:52] [INFO ] Deduced a trap composed of 102 places in 321 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:52] [INFO ] Deduced a trap composed of 102 places in 291 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:52] [INFO ] Deduced a trap composed of 102 places in 288 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:53] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:53] [INFO ] Deduced a trap composed of 102 places in 290 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:53] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:53] [INFO ] Deduced a trap composed of 102 places in 287 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:54] [INFO ] Deduced a trap composed of 102 places in 290 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:54] [INFO ] Deduced a trap composed of 102 places in 289 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:54] [INFO ] Deduced a trap composed of 102 places in 288 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:55] [INFO ] Deduced a trap composed of 102 places in 294 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:55] [INFO ] Deduced a trap composed of 102 places in 290 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:55] [INFO ] Deduced a trap composed of 102 places in 286 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:56] [INFO ] Deduced a trap composed of 102 places in 289 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :27142 after 179501
[2025-06-04 18:56:56] [INFO ] Deduced a trap composed of 102 places in 288 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:56] [INFO ] Deduced a trap composed of 102 places in 289 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:57] [INFO ] Deduced a trap composed of 102 places in 281 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:57] [INFO ] Deduced a trap composed of 102 places in 292 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:57] [INFO ] Deduced a trap composed of 102 places in 285 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:58] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:58] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:58] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:58] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:58] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:59] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:59] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:59] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:59] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:56:59] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:00] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:00] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:00] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:00] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:00] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:01] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:01] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:01] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:01] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:01] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:03] [INFO ] Deduced a trap composed of 102 places in 286 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:03] [INFO ] Deduced a trap composed of 102 places in 278 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:04] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:04] [INFO ] Deduced a trap composed of 102 places in 266 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :179501 after 556054
[2025-06-04 18:57:04] [INFO ] Deduced a trap composed of 102 places in 265 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:05] [INFO ] Deduced a trap composed of 102 places in 268 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:05] [INFO ] Deduced a trap composed of 102 places in 265 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:05] [INFO ] Deduced a trap composed of 102 places in 270 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:05] [INFO ] Deduced a trap composed of 102 places in 268 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:06] [INFO ] Deduced a trap composed of 102 places in 271 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:06] [INFO ] Deduced a trap composed of 102 places in 293 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:06] [INFO ] Deduced a trap composed of 102 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:07] [INFO ] Deduced a trap composed of 103 places in 265 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:07] [INFO ] Deduced a trap composed of 103 places in 264 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:07] [INFO ] Deduced a trap composed of 103 places in 262 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:07] [INFO ] Deduced a trap composed of 103 places in 297 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:08] [INFO ] Deduced a trap composed of 103 places in 262 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:08] [INFO ] Deduced a trap composed of 103 places in 253 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:08] [INFO ] Deduced a trap composed of 103 places in 250 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-04 18:57:09] [INFO ] Deduced a trap composed of 103 places in 264 ms of which 44 ms to minimize.
[2025-06-04 18:57:09] [INFO ] Flatten gal took : 60 ms
[2025-06-04 18:57:09] [INFO ] Applying decomposition
[2025-06-04 18:57:09] [INFO ] Flatten gal took : 52 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/graph6426998764732928901.txt' '-o' '/tmp/graph6426998764732928901.bin' '-w' '/tmp/graph6426998764732928901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6426998764732928901.bin' '-l' '-1' '-v' '-w' '/tmp/graph6426998764732928901.weights' '-q' '0' '-e' '0.001'
[2025-06-04 18:57:09] [INFO ] Decomposing Gal with order
[2025-06-04 18:57:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 18:57:09] [INFO ] Removed a total of 656 redundant transitions.
[2025-06-04 18:57:09] [INFO ] Flatten gal took : 124 ms
[2025-06-04 18:57:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 18 ms.
[2025-06-04 18:57:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10039513093692468320.gal : 14 ms
[2025-06-04 18:57:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1005021768994580950.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/ReachabilityCardinality10039513093692468320.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1005021768994580950.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
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1441 variables, and 152 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/586 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41726ms problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 41729ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41762 ms. Remains : 411/411 places, 1039/1039 transitions.
Loading property file /tmp/ReachabilityCardinality1005021768994580950.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
RANDOM walk for 40000 steps (2821 resets) in 776 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (366 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 530683 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 530683 steps, saw 86489 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2025-06-04 18:57:12] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:57:12] [INFO ] Invariant cache hit.
[2025-06-04 18:57:12] [INFO ] State equation strengthened by 1 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/410 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1030/1440 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1440 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1440 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1441 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1441 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1441 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1441/1441 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:13] [INFO ] Deduced a trap composed of 134 places in 221 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:13] [INFO ] Deduced a trap composed of 134 places in 226 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:14] [INFO ] Deduced a trap composed of 134 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:14] [INFO ] Deduced a trap composed of 134 places in 209 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:14] [INFO ] Deduced a trap composed of 134 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:14] [INFO ] Deduced a trap composed of 134 places in 214 ms of which 28 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/410 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:15] [INFO ] Deduced a trap composed of 148 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:15] [INFO ] Deduced a trap composed of 148 places in 207 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:15] [INFO ] Deduced a trap composed of 148 places in 207 ms of which 28 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1030/1440 variables, 410/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1440 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:16] [INFO ] Deduced a trap composed of 146 places in 705 ms of which 480 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:17] [INFO ] Deduced a trap composed of 146 places in 644 ms of which 425 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:17] [INFO ] Deduced a trap composed of 146 places in 568 ms of which 348 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:18] [INFO ] Deduced a trap composed of 146 places in 541 ms of which 318 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:19] [INFO ] Deduced a trap composed of 146 places in 617 ms of which 396 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:20] [INFO ] Deduced a trap composed of 146 places in 1070 ms of which 848 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:21] [INFO ] Deduced a trap composed of 146 places in 978 ms of which 755 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:23] [INFO ] Deduced a trap composed of 146 places in 1990 ms of which 1767 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 2134
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2134 after 2140
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2140 after 2157
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2157 after 2162
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2162 after 2175
[2025-06-04 18:57:24] [INFO ] Deduced a trap composed of 146 places in 1654 ms of which 1417 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:25] [INFO ] Deduced a trap composed of 146 places in 585 ms of which 369 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:26] [INFO ] Deduced a trap composed of 146 places in 1437 ms of which 1203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:27] [INFO ] Deduced a trap composed of 146 places in 869 ms of which 554 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:28] [INFO ] Deduced a trap composed of 146 places in 902 ms of which 668 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:32] [INFO ] Deduced a trap composed of 146 places in 4020 ms of which 3779 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 2048
SDD size :2175 after 2499
[2025-06-04 18:57:33] [INFO ] Deduced a trap composed of 146 places in 803 ms of which 557 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:35] [INFO ] Deduced a trap composed of 146 places in 1916 ms of which 1665 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:36] [INFO ] Deduced a trap composed of 146 places in 882 ms of which 648 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:37] [INFO ] Deduced a trap composed of 146 places in 913 ms of which 635 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:38] [INFO ] Deduced a trap composed of 146 places in 1000 ms of which 742 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:40] [INFO ] Deduced a trap composed of 146 places in 1883 ms of which 1645 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1440 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:42] [INFO ] Deduced a trap composed of 146 places in 1695 ms of which 1454 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2499 after 3429
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:44] [INFO ] Deduced a trap composed of 146 places in 2371 ms of which 2051 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:45] [INFO ] Deduced a trap composed of 146 places in 1080 ms of which 842 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:48] [INFO ] Deduced a trap composed of 146 places in 2950 ms of which 2703 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:50] [INFO ] Deduced a trap composed of 146 places in 2168 ms of which 1932 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:53] [INFO ] Deduced a trap composed of 146 places in 2629 ms of which 2392 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:54] [INFO ] Deduced a trap composed of 146 places in 800 ms of which 560 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:55] [INFO ] Deduced a trap composed of 146 places in 701 ms of which 454 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:57:57] [INFO ] Deduced a trap composed of 146 places in 1927 ms of which 1685 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-04 18:58:00] [INFO ] Deduced a trap composed of 146 places in 3740 ms of which 3498 ms to minimize.
SMT process timed out in 47948ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 411/411 places, 1039/1039 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1039/1039 transitions.
Applied a total of 0 rules in 31 ms. Remains 411 /411 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
[2025-06-04 18:58:00] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:58:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:58:01] [INFO ] Implicit Places using invariants in 514 ms returned []
[2025-06-04 18:58:01] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:58:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:58:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:58:03] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:58:03] [INFO ] Redundant transitions in 9 ms returned []
Running 1028 sub problems to find dead transitions.
[2025-06-04 18:58:03] [INFO ] Flow matrix only has 1030 transitions (discarded 9 similar events)
[2025-06-04 18:58:03] [INFO ] Invariant cache hit.
[2025-06-04 18:58:03] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:11] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:12] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:12] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:12] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:12] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:12] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:12] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:13] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:13] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:13] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:13] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:13] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:14] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:14] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:14] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:14] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:14] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:15] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:15] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:15] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:15] [INFO ] Deduced a trap composed of 102 places in 169 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:16] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:16] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:16] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:16] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:16] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:17] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:17] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:17] [INFO ] Deduced a trap composed of 102 places in 185 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:17] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:17] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:18] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:18] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:18] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:18] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:18] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:19] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:19] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:19] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:19] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:26] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:26] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:27] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:27] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:27] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:27] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:27] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:28] [INFO ] Deduced a trap composed of 102 places in 185 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:28] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:58:34] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 11 ms to minimize.
SMT process timed out in 31580ms, After SMT, problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 31582ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34077 ms. Remains : 411/411 places, 1039/1039 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-07 in 297641 ms.
[2025-06-04 18:58:34] [INFO ] Flatten gal took : 58 ms
[2025-06-04 18:58:35] [INFO ] Applying decomposition
[2025-06-04 18:58:35] [INFO ] Flatten gal took : 48 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/graph6522179287531990013.txt' '-o' '/tmp/graph6522179287531990013.bin' '-w' '/tmp/graph6522179287531990013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6522179287531990013.bin' '-l' '-1' '-v' '-w' '/tmp/graph6522179287531990013.weights' '-q' '0' '-e' '0.001'
[2025-06-04 18:58:35] [INFO ] Decomposing Gal with order
[2025-06-04 18:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 18:58:35] [INFO ] Removed a total of 2994 redundant transitions.
[2025-06-04 18:58:35] [INFO ] Flatten gal took : 92 ms
[2025-06-04 18:58:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 35 ms.
[2025-06-04 18:58:35] [INFO ] Time to serialize gal into /tmp/UpperBounds12296459408311134988.gal : 7 ms
[2025-06-04 18:58:35] [INFO ] Time to serialize properties into /tmp/UpperBounds5007239641339153107.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/UpperBounds12296459408311134988.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5007239641339153107.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 ...284
Loading property file /tmp/UpperBounds5007239641339153107.prop.
ITS-tools command line returned an error code 137
[2025-06-04 19:19:29] [INFO ] Applying decomposition
[2025-06-04 19:19:30] [INFO ] Flatten gal took : 512 ms
[2025-06-04 19:19:30] [INFO ] Decomposing Gal with order
[2025-06-04 19:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 19:19:30] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[CreatedJobs_205],[CreatedJobs_206],[CreatedJobs_207],[CreatedJobs_208],[CreatedJobs_209],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[place_482_5],[place_482_6],[place_482_7],[place_482_8],[place_482_9],[ModifiedSrc_0, TheSour_0],[ModifiedSrc_1, TheSour_1],[ModifiedSrc_2, TheSour_2],[ModifiedSrc_3, TheSour_3],[ModifiedSrc_4, TheSour_4],[ModifiedSrc_5, TheSour_5],[ModifiedSrc_6, TheSour_6],[ModifiedSrc_7, TheSour_7],[ModifiedSrc_8, TheSour_8],[ModifiedSrc_9, TheSour_9],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
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)
[2025-06-04 19:19:31] [INFO ] Flatten gal took : 288 ms
[2025-06-04 19:19:31] [INFO ] Time to serialize gal into /tmp/UpperBounds11815070254048739059.gal : 40 ms
[2025-06-04 19:19:31] [INFO ] Time to serialize properties into /tmp/UpperBounds534290590456238522.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/UpperBounds11815070254048739059.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds534290590456238522.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/UpperBounds534290590456238522.prop.
Detected timeout of ITS tools.
[2025-06-04 19:43:41] [INFO ] Flatten gal took : 441 ms
[2025-06-04 19:43:44] [INFO ] Input system was already deterministic with 1039 transitions.
[2025-06-04 19:43:44] [INFO ] Transformed 411 places.
[2025-06-04 19:43:44] [INFO ] Transformed 1039 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-04 19:44:14] [INFO ] Time to serialize gal into /tmp/UpperBounds2486367743138400623.gal : 18 ms
[2025-06-04 19:44:14] [INFO ] Time to serialize properties into /tmp/UpperBounds2708277312099536377.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/UpperBounds2486367743138400623.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2708277312099536377.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds2708277312099536377.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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="PolyORBNT-COL-S10J20"
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 PolyORBNT-COL-S10J20, 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 r156-tall-174881254300597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 ;