About the Execution of ITS-Tools for LamportFastMutEx-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 122705.00 | 0.00 | 0.00 | 4 3 4 3 12 1 3 4 4 1 3 12 3 4 3 4 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423000613.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 LamportFastMutEx-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423000613
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 40K 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 LamportFastMutEx-COL-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748872636254
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-02 13:57:17] [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-02 13:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:57:17] [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-02 13:57:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 13:57:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 643 ms
[2025-06-02 13:57:18] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 13:57:18] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2025-06-02 13:57:18] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2025-06-02 13:57:18] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[4, 0, 0, 0, 0, 1, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 16, 1, 4, 4, 4, 4, 4, 16, 4, 4, 4, 4]
FORMULA LamportFastMutEx-COL-4-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 13:57:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:18] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 13:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 13:57:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:18] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 13:57:18] [INFO ] Added : 5 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 13:57: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-02 13:57:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 13:57:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 13:57:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:18] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:18] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:18] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 13:57:18] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:18] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 13:57: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-02 13:57:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 13:57:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 13:57:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:18] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:18] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 13:57:19] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:19] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:19] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 13:57:19] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 13:57:19] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 13:57:19] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:19] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 13:57:19] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:19] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:19] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 10 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:19] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:19] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:19] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 13:57:19] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 13:57:19] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 13:57:19] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 13:57: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-02 13:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 13:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 13:57:19] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 13:57:19] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 16, 4, 4, 4, 4, 16, 4, 4, 4, 4]
Domain [pid(5), pid(5)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 13:57:20] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 24 ms.
[2025-06-02 13:57:20] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 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, +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, 0] Max Struct:[4, 4, 4, 16, 4, 4, 4, 4, 16, 4, 4, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 16, 4, 4, 4, 4, 16, 4, 4, 4, 4]
[2025-06-02 13:57:20] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2025-06-02 13:57:20] [INFO ] Computed 26 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 16, 4, 4, 4, 4, 16, 4, 4, 4, 4]
RANDOM walk for 10000 steps (2 resets) in 66 ms. (149 steps per ms)
FORMULA LamportFastMutEx-COL-4-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 208 ms. (430 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 11, 3, 1, 3, 12, 3, 3] Max Struct:[4, 4, 16, 4, 4, 4, 16, 4, 4]
[2025-06-02 13:57:20] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2025-06-02 13:57:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:20] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2025-06-02 13:57:20] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-02 13:57:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 13:57:20] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2025-06-02 13:57:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:20] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:20] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-02 13:57:20] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:20] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:20] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:20] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:20] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 6 places in 325 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 5 ms to minimize.
[2025-06-02 13:57:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 942 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:21] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-02 13:57:21] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2025-06-02 13:57: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-02 13:57:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:21] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-06-02 13:57:21] [INFO ] [Nat]Added 40 Read/Feed constraints in 28 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:21] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 5 ms to minimize.
[2025-06-02 13:57:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 937 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:22] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:22] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 13:57:22] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2025-06-02 13:57:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:22] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:22] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 13:57:22] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:22] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
[2025-06-02 13:57:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 322 ms
[2025-06-02 13:57:23] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
[2025-06-02 13:57:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2025-06-02 13:57:23] [INFO ] Added : 40 causal constraints over 10 iterations in 290 ms. Result :sat
Minimization took 56 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:23] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:23] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 13:57:23] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2025-06-02 13:57:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:23] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:23] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-02 13:57:23] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:23] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:24] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
[2025-06-02 13:57:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 410 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:24] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-02 13:57:24] [INFO ] [Real]Added 40 Read/Feed constraints in 4 ms returned sat
[2025-06-02 13:57: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-02 13:57:24] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:24] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 13:57:24] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2025-06-02 13:57:24] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:24] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:24] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:24] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:24] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:24] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 7 ms to minimize.
[2025-06-02 13:57:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 374 ms
[2025-06-02 13:57:24] [INFO ] Added : 67 causal constraints over 15 iterations in 559 ms. Result :sat
Minimization took 73 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:24] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2025-06-02 13:57:24] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-02 13:57:24] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2025-06-02 13:57: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-02 13:57:24] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:25] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-02 13:57:25] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 10 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-02 13:57:25] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
[2025-06-02 13:57:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 548 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:25] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:25] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 13:57:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:25] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:25] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 13:57:25] [INFO ] [Nat]Added 40 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:25] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 5 ms to minimize.
[2025-06-02 13:57:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 348 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:26] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:26] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-02 13:57:26] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2025-06-02 13:57:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:26] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:26] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 13:57:26] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 3 ms to minimize.
[2025-06-02 13:57:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 424 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:26] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:26] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-02 13:57:26] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2025-06-02 13:57:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 13:57:26] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:26] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-02 13:57:26] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
[2025-06-02 13:57:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 530 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 11, 3, 1, 3, 12, 3, 3] Max Struct:[3, 3, 16, 3, 4, 3, 12, 3, 3]
FORMULA LamportFastMutEx-COL-4-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-11 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 1] Max Struct:[16, 4]
Support contains 20 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 176
Applied a total of 8 rules in 26 ms. Remains 98 /102 variables (removed 4) and now considering 176/180 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 98/102 places, 176/180 transitions.
[2025-06-02 13:57:27] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
// Phase 1: matrix 140 rows 98 cols
[2025-06-02 13:57:27] [INFO ] Computed 26 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11, 1] Max Struct:[16, 4]
RANDOM walk for 1000000 steps (2 resets) in 2597 ms. (384 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1532 ms. (1304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 1] Max Struct:[16, 4]
[2025-06-02 13:57:31] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
[2025-06-02 13:57:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:57:31] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:31] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 13:57:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:57:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-02 13:57:31] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-06-02 13:57:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 13:57:31] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:31] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2025-06-02 13:57:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 495 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:57:32] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:32] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 13:57:32] [INFO ] [Real]Added 40 Read/Feed constraints in 4 ms returned sat
[2025-06-02 13:57:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:57:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 13:57:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 6 ms to minimize.
[2025-06-02 13:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-06-02 13:57:32] [INFO ] Computed and/alt/rep : 124/508/124 causal constraints (skipped 12 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:32] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
[2025-06-02 13:57:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2025-06-02 13:57:32] [INFO ] Added : 46 causal constraints over 10 iterations in 367 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 1] Max Struct:[12, 4]
FORMULA LamportFastMutEx-COL-4-UpperBounds-04 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 176/176 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 94 transition count 172
Applied a total of 8 rules in 16 ms. Remains 94 /98 variables (removed 4) and now considering 172/176 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 94/98 places, 172/176 transitions.
[2025-06-02 13:57:33] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2025-06-02 13:57:33] [INFO ] Computed 26 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 2303 ms. (434 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 746 ms. (1338 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2025-06-02 13:57:36] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-02 13:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:57:36] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:36] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 13:57:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 13:57:36] [INFO ] [Real]Added 40 Read/Feed constraints in 4 ms returned sat
[2025-06-02 13:57:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:57:36] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-02 13:57:36] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-02 13:57:36] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:36] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 4 ms to minimize.
[2025-06-02 13:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-06-02 13:57:36] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 10 ms.
[2025-06-02 13:57:36] [INFO ] Added : 54 causal constraints over 11 iterations in 134 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2025-06-02 13:57:36] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-02 13:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:57:36] [INFO ] Implicit Places using invariants in 102 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 103 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 118 ms. Remains : 90/94 places, 172/172 transitions.
[2025-06-02 13:57:36] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2025-06-02 13:57:36] [INFO ] Computed 22 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 2261 ms. (442 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 726 ms. (1375 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2025-06-02 13:57:39] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-02 13:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:57:39] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2025-06-02 13:57:39] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-02 13:57:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 13:57:39] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2025-06-02 13:57:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:57:39] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2025-06-02 13:57:39] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 13:57:39] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:40] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 5 ms to minimize.
[2025-06-02 13:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2025-06-02 13:57:40] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 12 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:40] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:40] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:40] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
[2025-06-02 13:57:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2025-06-02 13:57:40] [INFO ] Added : 71 causal constraints over 15 iterations in 415 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 10 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2025-06-02 13:57:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-02 13:57:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:57:40] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 13:57:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-02 13:57:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:57:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 13:57:40] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:57:40] [INFO ] Redundant transitions in 7 ms returned []
Running 168 sub problems to find dead transitions.
[2025-06-02 13:57:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-02 13:57:40] [INFO ] Invariant cache hit.
[2025-06-02 13:57:40] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 5 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 6 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 6 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 3 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 21 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 6 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-02 13:57:42] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:42] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:43] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 6 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 11/73 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:45] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:45] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:45] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 3/76 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:46] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:46] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 2/78 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:46] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:46] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:46] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:46] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:46] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 5/83 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/83 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 136/226 variables, 90/173 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 24/197 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:48] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:48] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 2/199 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/199 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 0/226 variables, 0/199 constraints. Problems are: Problem set: 24 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 199 constraints, problems are : Problem set: 24 solved, 144 unsolved in 11013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 39/45 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/45 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/61 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 24/85 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:52] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/86 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/86 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 136/226 variables, 90/176 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 24/200 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 144/344 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:54] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:54] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:54] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 3/347 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:56] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:56] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:56] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:56] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:56] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:57] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 6/353 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:59] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:59] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:59] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:59] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 5/358 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/358 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:06] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:06] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:06] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/226 variables, 3/361 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:10] [INFO ] Deduced a trap along path composed of 4 places in 39 ms of which 11 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 1/362 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:13] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:14] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 2/364 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:17] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 1/365 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 365 constraints, problems are : Problem set: 24 solved, 144 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 144/168 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41102ms problems are : Problem set: 24 solved, 144 unsolved
Search for dead transitions found 24 dead transitions in 41110ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/90 places, 148/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:58:22] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41395 ms. Remains : 90/90 places, 148/172 transitions.
[2025-06-02 13:58:22] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
// Phase 1: matrix 120 rows 90 cols
[2025-06-02 13:58:22] [INFO ] Computed 22 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 2216 ms. (451 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 718 ms. (1390 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2025-06-02 13:58:24] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:58:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:58:24] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2025-06-02 13:58:25] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 13:58:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:58:25] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2025-06-02 13:58:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 13:58:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2025-06-02 13:58:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 13:58:25] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:25] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:25] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 5 ms to minimize.
[2025-06-02 13:58:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2025-06-02 13:58:25] [INFO ] Computed and/alt/rep : 104/420/104 causal constraints (skipped 12 transitions) in 7 ms.
[2025-06-02 13:58:25] [INFO ] Added : 54 causal constraints over 11 iterations in 118 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2025-06-02 13:58:25] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:58:25] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 13:58:25] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:58:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 13:58:25] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:58:25] [INFO ] Redundant transitions in 3 ms returned []
Running 144 sub problems to find dead transitions.
[2025-06-02 13:58:25] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:58:25] [INFO ] Invariant cache hit.
[2025-06-02 13:58:25] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:26] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:26] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:26] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:26] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:26] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:26] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:26] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 9 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-02 13:58:27] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:30] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:30] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:30] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:31] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:31] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:31] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:31] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 120/210 variables, 90/163 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:34] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:34] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:34] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:35] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:35] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:36] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:37] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:38] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 198 constraints, problems are : Problem set: 0 solved, 144 unsolved in 15026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:41] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:41] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:41] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:41] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:41] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 120/210 variables, 90/182 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 144/346 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:45] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:48] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:48] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:48] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:48] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:50] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:50] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:52] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:54] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:00] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:00] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:01] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:04] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:06] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:06] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 364 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45068ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 45070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45300 ms. Remains : 90/90 places, 148/148 transitions.
[2025-06-02 13:59:10] [INFO ] Flatten gal took : 48 ms
[2025-06-02 13:59:11] [INFO ] Flatten gal took : 28 ms
[2025-06-02 13:59:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14714550324840667058.gal : 13 ms
[2025-06-02 13:59:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2600081294127076516.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/ReachabilityCardinality14714550324840667058.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2600081294127076516.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/ReachabilityCardinality2600081294127076516.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
RANDOM walk for 40000 steps (8 resets) in 1018 ms. (39 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 100
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :100 after 220
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :220 after 1151
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1151 after 2192
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2192 after 6102
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6102 after 38886
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :38886 after 74567
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :74567 after 266615
Interrupted probabilistic random walk after 832139 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :0 out of 2
Probabilistic random walk after 832139 steps, saw 208343 distinct states, run finished after 3005 ms. (steps per millisecond=276 ) properties seen :0
[2025-06-02 13:59:14] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-02 13:59:14] [INFO ] Invariant cache hit.
[2025-06-02 13:59:14] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:14] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:14] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:14] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:14] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 21 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:14] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:15] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:15] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:15] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/210 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:15] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:15] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:15] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/210 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 145 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1211ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 218 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 148/148 transitions.
RANDOM walk for 40000 steps (8 resets) in 390 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :748706 after 1.01697e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.4985e+06,6.75993,195064,2,44347,20,583660,8,0,512,733397,0
Total reachable state count : 1498496
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,6.77738,195064,1,0,20,583660,8,0,519,733397,0
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,6.79927,195064,1,0,20,583660,8,0,525,733397,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 1011765 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 2
Probabilistic random walk after 1011765 steps, saw 245787 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
FORMULA LamportFastMutEx-COL-4-UpperBounds-09 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 121267 ms.
BK_STOP 1748872758959
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-4"
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 LamportFastMutEx-COL-4, 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 r114-tall-174876423000613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 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 ;