About the Execution of ITS-Tools for LamportFastMutEx-COL-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 8 8 1 7 8 7 7 8 7 1 56 8 ? 7 56 8 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423100645.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-8, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423100645
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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 44K 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-8-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748880666470
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-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-02 16:11:07] [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 16:11:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:11:07] [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 16:11:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 16:11:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 672 ms
[2025-06-02 16:11:08] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2025-06-02 16:11:08] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2025-06-02 16:11:08] [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 16:11:08] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[8, 0, 1, 0, 0, 0, 0, 8, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 1, 8, 8, 8, 8, 8, 8, 1, 64, 8, 8, 8, 64, 8]
FORMULA LamportFastMutEx-COL-8-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 16:11:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:08] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-06-02 16:11:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 16:11:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 16:11:08] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 16:11:09] [INFO ] Added : 4 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 16:11:09] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 16:11:09] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 16:11:09] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 16:11:09] [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 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 16:11:09] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 16:11:09] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 16:11:09] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 16:11:09] [INFO ] Added : 9 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:11:09] [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 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:11:09] [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 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:11:09] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:11:09] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:11:09] [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 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 16:11:09] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:11:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:11:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:11:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 16:11:10] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:11:10] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:11:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:11:10] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 16:11:10] [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 16:11:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 16:11:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 16:11:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:11:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:11:10] [INFO ] Added : 4 causal constraints over 1 iterations in 5 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] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 8, 8, 64, 8]
Domain [pid(9), pid(9)] 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 16:11:10] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 33 ms.
[2025-06-02 16:11:10] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 8, 8, 64, 8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 8, 8, 64, 8]
[2025-06-02 16:11:10] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2025-06-02 16:11:10] [INFO ] Computed 82 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 8, 8, 64, 8]
RANDOM walk for 10000 steps (2 resets) in 109 ms. (90 steps per ms)
FORMULA LamportFastMutEx-COL-8-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100008 steps (20 resets) in 239 ms. (416 steps per ms)
FORMULA LamportFastMutEx-COL-8-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[4, 2, 7, 7, 5, 24, 1, 4, 56] Max Struct:[8, 8, 8, 8, 8, 64, 8, 8, 64]
[2025-06-02 16:11:10] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 16:11:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:10] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-02 16:11:10] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2025-06-02 16:11:10] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 16:11:10] [INFO ] [Real]Added 112 Read/Feed constraints in 18 ms returned sat
[2025-06-02 16:11:10] [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 16:11:10] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-02 16:11:10] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-06-02 16:11:10] [INFO ] [Nat]Added 112 Read/Feed constraints in 18 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:13] [INFO ] Deduced a trap composed of 16 places in 2602 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:13] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:13] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:13] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:14] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:14] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 5 ms to minimize.
[2025-06-02 16:11:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3225 ms
[2025-06-02 16:11:14] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 34 ms.
[2025-06-02 16:11:14] [INFO ] Added : 33 causal constraints over 7 iterations in 255 ms. Result :sat
Minimization took 151 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:14] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-02 16:11:14] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-06-02 16:11:14] [INFO ] [Real]Added 112 Read/Feed constraints in 14 ms returned sat
[2025-06-02 16:11:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:14] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-02 16:11:14] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-02 16:11:15] [INFO ] [Nat]Added 112 Read/Feed constraints in 34 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:15] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:15] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 13 ms to minimize.
[2025-06-02 16:11:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2025-06-02 16:11:15] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 31 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:16] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:16] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:16] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:16] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:16] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:16] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 6 ms to minimize.
[2025-06-02 16:11:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1002 ms
[2025-06-02 16:11:16] [INFO ] Added : 99 causal constraints over 21 iterations in 1642 ms. Result :sat
Minimization took 177 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:17] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-02 16:11:17] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-06-02 16:11:17] [INFO ] [Real]Added 112 Read/Feed constraints in 18 ms returned sat
[2025-06-02 16:11:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:17] [INFO ] [Nat]Absence check using 82 positive place invariants in 20 ms returned sat
[2025-06-02 16:11:17] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2025-06-02 16:11:17] [INFO ] [Nat]Added 112 Read/Feed constraints in 47 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:17] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:17] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:17] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:18] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:18] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:18] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:18] [INFO ] Deduced a trap composed of 17 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 16:11:18] [INFO ] Deduced a trap composed of 17 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 16:11:18] [INFO ] Deduced a trap composed of 17 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 16:11:18] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 5 ms to minimize.
[2025-06-02 16:11:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1021 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:18] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2025-06-02 16:11:18] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-06-02 16:11:18] [INFO ] [Real]Added 112 Read/Feed constraints in 21 ms returned sat
[2025-06-02 16:11: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 16:11:18] [INFO ] [Nat]Absence check using 82 positive place invariants in 19 ms returned sat
[2025-06-02 16:11:19] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-06-02 16:11:19] [INFO ] [Nat]Added 112 Read/Feed constraints in 77 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:19] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:19] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:19] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:19] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:19] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:20] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:20] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:20] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:20] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:20] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:20] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:21] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:21] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:21] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:21] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:21] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:22] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:22] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:22] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:22] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:22] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:22] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:22] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:23] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:23] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 6 ms to minimize.
[2025-06-02 16:11:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 25 trap constraints in 4064 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:23] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-02 16:11:23] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-06-02 16:11:23] [INFO ] [Real]Added 112 Read/Feed constraints in 11 ms returned sat
[2025-06-02 16:11: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 16:11:23] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2025-06-02 16:11:23] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-06-02 16:11:23] [INFO ] [Nat]Added 112 Read/Feed constraints in 35 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:23] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:23] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:23] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:24] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:24] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:24] [INFO ] Deduced a trap composed of 17 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 16:11:24] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:24] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:24] [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 16:11:24] [INFO ] Deduced a trap composed of 17 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 16:11:24] [INFO ] Deduced a trap composed of 17 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 16:11:24] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 5 ms to minimize.
[2025-06-02 16:11:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1212 ms
[2025-06-02 16:11:24] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:25] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:25] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 8 ms to minimize.
[2025-06-02 16:11:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2025-06-02 16:11:25] [INFO ] Added : 133 causal constraints over 27 iterations in 1073 ms. Result :sat
Minimization took 193 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:26] [INFO ] [Real]Absence check using 82 positive place invariants in 20 ms returned sat
[2025-06-02 16:11:26] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2025-06-02 16:11: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 16:11:26] [INFO ] [Nat]Absence check using 82 positive place invariants in 20 ms returned sat
[2025-06-02 16:11:26] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2025-06-02 16:11:26] [INFO ] [Nat]Added 112 Read/Feed constraints in 71 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:26] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:26] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:26] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:27] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:27] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:27] [INFO ] Deduced a trap composed of 17 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 16:11:27] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:27] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 3 ms to minimize.
[2025-06-02 16:11:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 917 ms
[2025-06-02 16:11:27] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 31 ms.
[2025-06-02 16:11:27] [INFO ] Added : 33 causal constraints over 7 iterations in 241 ms. Result :sat
Minimization took 245 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:28] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-02 16:11:28] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2025-06-02 16:11:28] [INFO ] [Real]Added 112 Read/Feed constraints in 11 ms returned sat
[2025-06-02 16:11:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:28] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-02 16:11:28] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-06-02 16:11:28] [INFO ] [Nat]Added 112 Read/Feed constraints in 32 ms returned sat
[2025-06-02 16:11:28] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 28 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:29] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:29] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:29] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:29] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:29] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:29] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 12 ms to minimize.
[2025-06-02 16:11:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1028 ms
[2025-06-02 16:11:29] [INFO ] Added : 77 causal constraints over 17 iterations in 1609 ms. Result :sat
Minimization took 216 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:30] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-02 16:11:30] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2025-06-02 16:11:30] [INFO ] [Real]Added 112 Read/Feed constraints in 13 ms returned sat
[2025-06-02 16:11:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:30] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-02 16:11:30] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2025-06-02 16:11:30] [INFO ] [Nat]Added 112 Read/Feed constraints in 19 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:30] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:30] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:30] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:31] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:31] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:31] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:31] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:31] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:31] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 7 ms to minimize.
[2025-06-02 16:11:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 978 ms
[2025-06-02 16:11:31] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 28 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:32] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:32] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 4 ms to minimize.
[2025-06-02 16:11:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2025-06-02 16:11:32] [INFO ] Added : 52 causal constraints over 11 iterations in 594 ms. Result :sat
Minimization took 151 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:11:32] [INFO ] [Real]Absence check using 82 positive place invariants in 23 ms returned sat
[2025-06-02 16:11:32] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-06-02 16:11:32] [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 16:11:32] [INFO ] [Nat]Absence check using 82 positive place invariants in 25 ms returned sat
[2025-06-02 16:11:32] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-06-02 16:11:32] [INFO ] [Nat]Added 112 Read/Feed constraints in 90 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:33] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:33] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:33] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:33] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:33] [INFO ] Deduced a trap composed of 17 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 16:11:33] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:33] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:33] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:33] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:33] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:34] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:34] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:34] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 3 ms to minimize.
[2025-06-02 16:11:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1737 ms
Current structural bounds on expressions (after SMT) : Max Seen:[4, 2, 7, 7, 5, 24, 1, 4, 56] Max Struct:[8, 8, 7, 7, 8, 64, 8, 8, 56]
FORMULA LamportFastMutEx-COL-8-UpperBounds-14 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5, 5, 37, 1, 5] Max Struct:[8, 8, 8, 64, 8, 8]
Support contains 104 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 33 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 266/266 places, 584/584 transitions.
[2025-06-02 16:11:36] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 16:11:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5, 5, 37, 1, 5] Max Struct:[8, 8, 8, 64, 8, 8]
RANDOM walk for 1000000 steps (2 resets) in 4676 ms. (213 steps per ms)
FORMULA LamportFastMutEx-COL-8-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000005 steps (10 resets) in 5081 ms. (983 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 7, 37, 1, 7] Max Struct:[8, 8, 64, 8, 8]
[2025-06-02 16:11:46] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 16:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:11:46] [INFO ] [Real]Absence check using 82 positive place invariants in 20 ms returned sat
[2025-06-02 16:11:46] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-06-02 16:11:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 16:11:46] [INFO ] [Real]Added 112 Read/Feed constraints in 14 ms returned sat
[2025-06-02 16:11:46] [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 16:11:46] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-02 16:11:46] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-06-02 16:11:46] [INFO ] [Nat]Added 112 Read/Feed constraints in 29 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:46] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:47] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:47] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:47] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:47] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:47] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:47] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:47] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:48] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:48] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:48] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:48] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:48] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:48] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:48] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:49] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 8 ms to minimize.
[2025-06-02 16:11:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 2344 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:11:49] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2025-06-02 16:11:49] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-06-02 16:11:49] [INFO ] [Real]Added 112 Read/Feed constraints in 41 ms returned sat
[2025-06-02 16:11:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:11:49] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-02 16:11:49] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2025-06-02 16:11:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 62 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:49] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:49] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:49] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 4 ms to minimize.
[2025-06-02 16:11:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1346 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:11:50] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-02 16:11:51] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-02 16:11:51] [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 16:11:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 22 ms returned sat
[2025-06-02 16:11:51] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-02 16:11:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 87 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:51] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:51] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:51] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:51] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:51] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:52] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:52] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:52] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:52] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 4 ms to minimize.
[2025-06-02 16:11:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 967 ms
[2025-06-02 16:11:52] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 25 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:52] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:53] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:53] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 4 ms to minimize.
[2025-06-02 16:11:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 654 ms
[2025-06-02 16:11:53] [INFO ] Added : 51 causal constraints over 11 iterations in 1200 ms. Result :sat
Minimization took 218 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:11:53] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-02 16:11:53] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2025-06-02 16:11:53] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2025-06-02 16:11:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:11:54] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-02 16:11:54] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-06-02 16:11:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 31 ms returned sat
[2025-06-02 16:11:54] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 24 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:54] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:55] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:55] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:55] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:55] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:55] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 12 ms to minimize.
[2025-06-02 16:11:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1062 ms
[2025-06-02 16:11:55] [INFO ] Added : 77 causal constraints over 17 iterations in 1653 ms. Result :sat
Minimization took 226 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:11:56] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-02 16:11:56] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-02 16:11:56] [INFO ] [Real]Added 112 Read/Feed constraints in 11 ms returned sat
[2025-06-02 16:11:56] [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 16:11:56] [INFO ] [Nat]Absence check using 82 positive place invariants in 20 ms returned sat
[2025-06-02 16:11:56] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-06-02 16:11:56] [INFO ] [Nat]Added 112 Read/Feed constraints in 34 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:56] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:56] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:56] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:57] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:57] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:57] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:57] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:57] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:57] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:57] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:58] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:58] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:58] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:58] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 6 ms to minimize.
[2025-06-02 16:11:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1888 ms
Current structural bounds on expressions (after SMT) : Max Seen:[7, 7, 37, 1, 7] Max Struct:[7, 7, 64, 8, 7]
FORMULA LamportFastMutEx-COL-8-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[37, 1] Max Struct:[64, 8]
Support contains 72 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 266 transition count 576
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 62 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 258/266 places, 576/584 transitions.
[2025-06-02 16:11:59] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2025-06-02 16:11:59] [INFO ] Computed 82 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[37, 1] Max Struct:[64, 8]
RANDOM walk for 1000000 steps (2 resets) in 4177 ms. (239 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 2981 ms. (670 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[56, 1] Max Struct:[64, 8]
[2025-06-02 16:12:06] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2025-06-02 16:12:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:12:06] [INFO ] [Real]Absence check using 82 positive place invariants in 20 ms returned sat
[2025-06-02 16:12:06] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2025-06-02 16:12:06] [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 16:12:06] [INFO ] [Nat]Absence check using 82 positive place invariants in 19 ms returned sat
[2025-06-02 16:12:06] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-02 16:12:06] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 16:12:06] [INFO ] [Nat]Added 112 Read/Feed constraints in 152 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:06] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:06] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:08] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:08] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 4 ms to minimize.
[2025-06-02 16:12:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 2372 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:12:09] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-02 16:12:09] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-02 16:12:09] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2025-06-02 16:12:09] [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 16:12:09] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2025-06-02 16:12:09] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-06-02 16:12:09] [INFO ] [Nat]Added 112 Read/Feed constraints in 15 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:09] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 5 ms to minimize.
[2025-06-02 16:12:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-06-02 16:12:09] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:10] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:10] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:10] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:10] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:10] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:11] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:11] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:11] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 6 ms to minimize.
[2025-06-02 16:12:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1451 ms
[2025-06-02 16:12:11] [INFO ] Added : 96 causal constraints over 20 iterations in 1952 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[56, 1] Max Struct:[56, 8]
FORMULA LamportFastMutEx-COL-8-UpperBounds-10 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 568
Applied a total of 16 rules in 39 ms. Remains 250 /258 variables (removed 8) and now considering 568/576 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 250/258 places, 568/576 transitions.
[2025-06-02 16:12:12] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2025-06-02 16:12:12] [INFO ] Computed 82 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 3385 ms. (295 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 913 ms. (1094 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 16:12:16] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 16:12:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:12:16] [INFO ] [Real]Absence check using 82 positive place invariants in 26 ms returned sat
[2025-06-02 16:12:16] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-02 16:12:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 16:12:16] [INFO ] [Real]Added 112 Read/Feed constraints in 11 ms returned sat
[2025-06-02 16:12:16] [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 16:12:16] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-02 16:12:16] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-06-02 16:12:16] [INFO ] [Nat]Added 112 Read/Feed constraints in 17 ms returned sat
[2025-06-02 16:12:16] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:17] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:17] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:17] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:17] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:18] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 13 ms to minimize.
[2025-06-02 16:12:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 950 ms
[2025-06-02 16:12:18] [INFO ] Added : 51 causal constraints over 11 iterations in 1337 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 16 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2025-06-02 16:12:18] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 16:12:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:12:18] [INFO ] Implicit Places using invariants in 338 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 340 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 373 ms. Remains : 242/250 places, 568/568 transitions.
[2025-06-02 16:12:18] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2025-06-02 16:12:18] [INFO ] Computed 74 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 3298 ms. (303 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 881 ms. (1133 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 16:12:23] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 16:12:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:12:23] [INFO ] [Real]Absence check using 74 positive place invariants in 14 ms returned sat
[2025-06-02 16:12:23] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-06-02 16:12:23] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 16:12:23] [INFO ] [Real]Added 48 Read/Feed constraints in 7 ms returned sat
[2025-06-02 16:12:23] [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 16:12:23] [INFO ] [Nat]Absence check using 74 positive place invariants in 15 ms returned sat
[2025-06-02 16:12:23] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-06-02 16:12:23] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:23] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 23 ms to minimize.
[2025-06-02 16:12:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2025-06-02 16:12:23] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 49 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:24] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:24] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:25] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:25] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:25] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:25] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:25] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:25] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:26] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:26] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 11 ms to minimize.
[2025-06-02 16:12:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1731 ms
[2025-06-02 16:12:26] [INFO ] Added : 113 causal constraints over 23 iterations in 2490 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2025-06-02 16:12:26] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 16:12:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:12:27] [INFO ] Implicit Places using invariants in 271 ms returned []
[2025-06-02 16:12:27] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 16:12:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:12:27] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 16:12:27] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:12:27] [INFO ] Redundant transitions in 32 ms returned []
Running 560 sub problems to find dead transitions.
[2025-06-02 16:12:27] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 16:12:27] [INFO ] Invariant cache hit.
[2025-06-02 16:12:27] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:30] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 10 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:30] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 9 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:30] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 10 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:30] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 11 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:30] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 9 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:31] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 11 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:31] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 10 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:31] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 9 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:31] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:31] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:31] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:32] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:32] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:32] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:32] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:32] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:33] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 10 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:33] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 8 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:33] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 7 ms to minimize.
Problem TDEAD124 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:33] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 7 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 26 solved, 534 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:33] [INFO ] Deduced a trap composed of 7 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 16:12:33] [INFO ] Deduced a trap composed of 7 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 16:12:34] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:34] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:34] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:34] [INFO ] Deduced a trap composed of 10 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 16:12:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:34] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:34] [INFO ] Deduced a trap composed of 10 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 16:12:34] [INFO ] Deduced a trap composed of 7 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 16:12:34] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:35] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:35] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:35] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:35] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Problem TDEAD159 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:35] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:36] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:36] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:36] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 6 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 47 solved, 513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:37] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:37] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:37] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 3 ms to minimize.
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:38] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:38] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:38] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:38] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:38] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:38] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:39] [INFO ] Deduced a trap composed of 17 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 16:12:39] [INFO ] Deduced a trap composed of 17 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 16:12:39] [INFO ] Deduced a trap composed of 17 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 16:12:39] [INFO ] Deduced a trap composed of 17 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 16:12:39] [INFO ] Deduced a trap composed of 17 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 16:12:39] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:39] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:39] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:40] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:40] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:40] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 18 ms to minimize.
Problem TDEAD256 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:44] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:44] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:44] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:45] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:45] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:45] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:45] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:45] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:45] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:46] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:46] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:46] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:46] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:46] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:46] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:47] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:47] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:47] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:47] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:47] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:49] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:50] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:50] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:50] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:50] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:50] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:50] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:51] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:51] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:51] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:51] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:51] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:52] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:52] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:52] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:52] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:52] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:52] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:53] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:53] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:56] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:56] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:56] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 9/183 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/642 variables, and 183 constraints, problems are : Problem set: 48 solved, 512 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/48 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 109/109 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 48 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 66/76 constraints. Problems are: Problem set: 48 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/76 constraints. Problems are: Problem set: 48 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/140 constraints. Problems are: Problem set: 48 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 43/183 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:01] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:01] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:02] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:03] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:03] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:03] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:03] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:03] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:04] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:04] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:04] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:04] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:04] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:05] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:05] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:05] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:05] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:05] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:05] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:06] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/203 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:08] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:08] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:08] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:08] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:09] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:09] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:09] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:09] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:10] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:10] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:10] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:10] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:10] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:10] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:10] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:11] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:11] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 17/220 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:14] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:14] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:14] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:14] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:14] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 5/225 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:17] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/226 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:20] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:20] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/228 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:20] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 1/229 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:23] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:25] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 2/231 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/642 variables, and 231 constraints, problems are : Problem set: 48 solved, 512 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/48 constraints, PredecessorRefiner: 0/560 constraints, Known Traps: 157/157 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60310ms problems are : Problem set: 48 solved, 512 unsolved
Search for dead transitions found 48 dead transitions in 60324ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/242 places, 520/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:13:28] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61182 ms. Remains : 242/242 places, 520/568 transitions.
[2025-06-02 16:13:28] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
// Phase 1: matrix 368 rows 242 cols
[2025-06-02 16:13:28] [INFO ] Computed 74 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 3268 ms. (305 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 895 ms. (1116 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 16:13:32] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:13:32] [INFO ] [Real]Absence check using 74 positive place invariants in 14 ms returned sat
[2025-06-02 16:13:32] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-06-02 16:13:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 16:13:32] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2025-06-02 16:13: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 16:13:32] [INFO ] [Nat]Absence check using 74 positive place invariants in 16 ms returned sat
[2025-06-02 16:13:32] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-02 16:13:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2025-06-02 16:13:32] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 20 ms.
[2025-06-02 16:13:33] [INFO ] Added : 120 causal constraints over 24 iterations in 777 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2025-06-02 16:13:33] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:13:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:13:34] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-06-02 16:13:34] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:13:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:13:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 16:13:34] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:13:34] [INFO ] Redundant transitions in 4 ms returned []
Running 512 sub problems to find dead transitions.
[2025-06-02 16:13:34] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:13:34] [INFO ] Invariant cache hit.
[2025-06-02 16:13:34] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:40] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:43] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:43] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:43] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:43] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:43] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:43] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:46] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:46] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:46] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:46] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:47] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:47] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:47] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:47] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:47] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:47] [INFO ] Deduced a trap composed of 9 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 16:13:48] [INFO ] Deduced a trap composed of 9 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 16:13:48] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:48] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:48] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:48] [INFO ] Deduced a trap composed of 9 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 16:13:48] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:48] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:48] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:48] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:48] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:49] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:50] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:50] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:50] [INFO ] Deduced a trap composed of 16 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 16:13:50] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:50] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:50] [INFO ] Deduced a trap composed of 16 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 16:13:51] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:51] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:51] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:51] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:51] [INFO ] Deduced a trap composed of 7 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 16:13:51] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:51] [INFO ] Deduced a trap composed of 7 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 16:13:52] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:52] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:52] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:52] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:52] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:52] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:54] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:54] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:55] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:55] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:55] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:55] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:55] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:56] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:56] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:56] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:56] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:56] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:56] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:57] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:57] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:57] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:57] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:57] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:57] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:58] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:01] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:01] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:01] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:01] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:01] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:02] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:03] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:03] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:03] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:03] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:04] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:04] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:04] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:04] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:04] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 10 ms to minimize.
SMT process timed out in 30268ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30274ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31008 ms. Remains : 242/242 places, 520/520 transitions.
[2025-06-02 16:14:05] [INFO ] Flatten gal took : 158 ms
RANDOM walk for 40000 steps (8 resets) in 1008 ms. (39 steps per ms) remains 2/2 properties
[2025-06-02 16:14:05] [INFO ] Flatten gal took : 52 ms
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
[2025-06-02 16:14:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15580462985941208257.gal : 34 ms
[2025-06-02 16:14:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8028166802179370684.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/ReachabilityCardinality15580462985941208257.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8028166802179370684.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8028166802179370684.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 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 152
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :152 after 778
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :778 after 1625
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1625 after 3386
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3386 after 11073
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :11073 after 71606
Interrupted probabilistic random walk after 554151 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 2
Probabilistic random walk after 554151 steps, saw 286246 distinct states, run finished after 3004 ms. (steps per millisecond=184 ) properties seen :0
[2025-06-02 16:14:08] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:14:08] [INFO ] Invariant cache hit.
[2025-06-02 16:14:08] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 40/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/610 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 356 constraints, problems are : Problem set: 0 solved, 2 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 40/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 2/358 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 16:14:09] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:09] [INFO ] Deduced a trap composed of 22 places in 408 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:09] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:09] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:10] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:10] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:10] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :71606 after 187328
[2025-06-02 16:14:10] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:11] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:11] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:11] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 11/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/369 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 16:14:11] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:11] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:11] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:12] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:12] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:12] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:12] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:12] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:12] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:12] [INFO ] Deduced a trap composed of 7 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 16:14:13] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/610 variables, 11/380 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 16:14:13] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:13] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:13] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 17 ms to minimize.
SMT process timed out in 5257ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 242/242 places, 520/520 transitions.
RANDOM walk for 40000 steps (8 resets) in 539 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 518695 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 518695 steps, saw 269720 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2025-06-02 16:14:16] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:14:16] [INFO ] Invariant cache hit.
[2025-06-02 16:14:16] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 40/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/610 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 356 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 40/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 2/358 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 16:14:17] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:17] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:17] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:17] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:18] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:18] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:18] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:18] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:18] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:18] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:19] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 11/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/369 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 16:14:19] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :187328 after 2.90484e+06
[2025-06-02 16:14:19] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:19] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:19] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:20] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:20] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:20] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:20] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:20] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:20] [INFO ] Deduced a trap composed of 7 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 16:14:20] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/610 variables, 11/380 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 16:14:20] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:21] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:21] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 16 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 3/383 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 16:14:21] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/610 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/610 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4487 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4754ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 469 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 24 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2025-06-02 16:14:22] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:14:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:14:22] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 16:14:22] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:14:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:14:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 16:14:22] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:14:22] [INFO ] Redundant transitions in 4 ms returned []
Running 512 sub problems to find dead transitions.
[2025-06-02 16:14:22] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:14:22] [INFO ] Invariant cache hit.
[2025-06-02 16:14:22] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:28] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:29] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:29] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:29] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:29] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:29] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:29] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:29] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:29] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:30] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:30] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:30] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:30] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:30] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:30] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:30] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:31] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:31] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:31] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:31] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:33] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:33] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:34] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:34] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:34] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:34] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:34] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.90484e+06 after 6.503e+06
[2025-06-02 16:14:35] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:35] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:35] [INFO ] Deduced a trap composed of 9 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 16:14:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:35] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:35] [INFO ] Deduced a trap composed of 9 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 16:14:35] [INFO ] Deduced a trap composed of 9 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 16:14:35] [INFO ] Deduced a trap composed of 9 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 16:14:35] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:35] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:35] [INFO ] Deduced a trap composed of 41 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 16:14:36] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:36] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:37] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:37] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:37] [INFO ] Deduced a trap composed of 16 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 16:14:37] [INFO ] Deduced a trap composed of 16 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 16:14:38] [INFO ] Deduced a trap composed of 16 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 16:14:38] [INFO ] Deduced a trap composed of 16 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 16:14:38] [INFO ] Deduced a trap composed of 16 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 16:14:38] [INFO ] Deduced a trap composed of 16 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 16:14:38] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:38] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:38] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:38] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:38] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:38] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:39] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:39] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:39] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:39] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:39] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:39] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:41] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:41] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:42] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:42] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:42] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:42] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:42] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:43] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:43] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:43] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:43] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:43] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:43] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:43] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:44] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:44] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:44] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:44] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:44] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:45] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:48] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:48] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:48] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:48] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:48] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:49] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:49] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:50] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:50] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:50] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:50] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:51] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:51] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:51] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:51] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:51] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:51] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:51] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:52] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:52] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/610 variables, and 174 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Detected timeout of ITS tools.
[2025-06-02 16:14:55] [INFO ] Flatten gal took : 43 ms
[2025-06-02 16:14:55] [INFO ] Applying decomposition
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2025-06-02 16:14:55] [INFO ] Flatten gal took : 41 ms
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/137 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 37/174 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17102590602990749286.txt' '-o' '/tmp/graph17102590602990749286.bin' '-w' '/tmp/graph17102590602990749286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17102590602990749286.bin' '-l' '-1' '-v' '-w' '/tmp/graph17102590602990749286.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:14:55] [INFO ] Decomposing Gal with order
[2025-06-02 16:14:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:14:55] [INFO ] Removed a total of 632 redundant transitions.
[2025-06-02 16:14:55] [INFO ] Flatten gal took : 117 ms
[2025-06-02 16:14:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 246 labels/synchronizations in 37 ms.
[2025-06-02 16:14:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4417430885701680364.gal : 11 ms
[2025-06-02 16:14:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1711178093001810581.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4417430885701680364.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1711178093001810581.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 ...328
Loading property file /tmp/ReachabilityCardinality1711178093001810581.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 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 56
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :56 after 94
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :94 after 206
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :206 after 932
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :932 after 1855
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1855 after 4336
SDD proceeding with computation,2 properties remain. new max is 4096
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :4336 after 32956
[2025-06-02 16:14:57] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:57] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:58] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:58] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 14 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :32956 after 54578
[2025-06-02 16:14:58] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:58] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:58] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:58] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:59] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:59] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:59] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:59] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:59] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:00] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:00] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:00] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:00] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:00] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:00] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:00] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :54578 after 173079
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:02] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:03] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:03] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:03] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:03] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:03] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:03] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:04] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:04] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:04] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:04] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:04] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:04] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:05] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:05] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:05] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:05] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:05] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:05] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:06] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:07] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:08] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:09] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:09] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :173079 after 2.81867e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:12] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:12] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:12] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:12] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:15] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:15] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:15] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:15] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:18] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:18] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:18] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:18] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:18] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:18] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:18] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.81867e+06 after 4.3759e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:21] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:21] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/610 variables, and 235 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 161/161 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60769 ms. Remains : 242/242 places, 520/520 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 242 transition count 368
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 152 place count 242 transition count 304
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 336 place count 122 transition count 304
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 352 place count 114 transition count 296
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 368 place count 106 transition count 352
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 376 place count 106 transition count 344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 384 place count 98 transition count 344
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 98 transition count 344
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 98 transition count 344
Applied a total of 400 rules in 74 ms. Remains 98 /242 variables (removed 144) and now considering 344/520 (removed 176) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 344 rows 98 cols
[2025-06-02 16:15:22] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:15:22] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2025-06-02 16:15:23] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:15:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-02 16:15:23] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 16:15:23] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 16:15:23] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 16:15:23] [INFO ] Flatten gal took : 19 ms
[2025-06-02 16:15:23] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:15:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11283815228322112075.gal : 4 ms
[2025-06-02 16:15:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8610324262443260764.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11283815228322112075.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8610324262443260764.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/ReachabilityCardinality8610324262443260764.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 14
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 139
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :139 after 157
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :157 after 216
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :216 after 1687
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1687 after 2373
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2373 after 7520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7520 after 19016
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :19016 after 283656
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :283656 after 1.82673e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.82673e+06 after 4.11974e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.11974e+06 after 1.768e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.768e+07 after 4.24177e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.24177e+07 after 2.13264e+08
Detected timeout of ITS tools.
[2025-06-02 16:15:38] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:15:38] [INFO ] Applying decomposition
[2025-06-02 16:15:38] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3270541198050281180.txt' '-o' '/tmp/graph3270541198050281180.bin' '-w' '/tmp/graph3270541198050281180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3270541198050281180.bin' '-l' '-1' '-v' '-w' '/tmp/graph3270541198050281180.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:15:38] [INFO ] Decomposing Gal with order
[2025-06-02 16:15:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:15:38] [INFO ] Removed a total of 407 redundant transitions.
[2025-06-02 16:15:38] [INFO ] Flatten gal took : 55 ms
[2025-06-02 16:15:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 11 ms.
[2025-06-02 16:15:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3703015392011100215.gal : 4 ms
[2025-06-02 16:15:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12831835555091572394.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/ReachabilityCardinality3703015392011100215.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12831835555091572394.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/ReachabilityCardinality12831835555091572394.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 33
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :33 after 111
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :111 after 249
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :249 after 759
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :759 after 5064
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5064 after 109970
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :109970 after 2.53537e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.53537e+06 after 1.78658e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.78658e+07 after 7.2561e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.2561e+07 after 2.88682e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.24696e+09 after 2.27064e+09
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30705 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[8]
Starting property specific reduction for LamportFastMutEx-COL-8-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2025-06-02 16:15:53] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
// Phase 1: matrix 368 rows 242 cols
[2025-06-02 16:15:53] [INFO ] Computed 74 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 34 ms. (285 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 16:15:53] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:15:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:15:53] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2025-06-02 16:15:53] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-02 16:15:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 16:15:53] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2025-06-02 16:15:53] [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 16:15:53] [INFO ] [Nat]Absence check using 74 positive place invariants in 16 ms returned sat
[2025-06-02 16:15:53] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-06-02 16:15:53] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2025-06-02 16:15:53] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 23 ms.
[2025-06-02 16:15:54] [INFO ] Added : 120 causal constraints over 24 iterations in 725 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 520/520 transitions.
[2025-06-02 16:15:55] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:15:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 3278 ms. (304 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 853 ms. (1170 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 16:15:59] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:15:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:15:59] [INFO ] [Real]Absence check using 74 positive place invariants in 16 ms returned sat
[2025-06-02 16:15:59] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-02 16:15:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 16:15:59] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2025-06-02 16:15:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:15:59] [INFO ] [Nat]Absence check using 74 positive place invariants in 15 ms returned sat
[2025-06-02 16:15:59] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-02 16:15:59] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2025-06-02 16:15:59] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 19 ms.
[2025-06-02 16:16:00] [INFO ] Added : 120 causal constraints over 24 iterations in 703 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2025-06-02 16:16:00] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:16:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:00] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-02 16:16:00] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:16:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 16:16:01] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:16:01] [INFO ] Redundant transitions in 2 ms returned []
Running 512 sub problems to find dead transitions.
[2025-06-02 16:16:01] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:16:01] [INFO ] Invariant cache hit.
[2025-06-02 16:16:01] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:07] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:08] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:08] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:08] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:08] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:08] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:08] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:08] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:09] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:09] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:09] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:09] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:09] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:09] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:09] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:10] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:10] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:10] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:10] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:10] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:12] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:13] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:13] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:13] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:13] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:14] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:14] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:14] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:14] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:14] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:14] [INFO ] Deduced a trap composed of 9 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 16:16:14] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:14] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:15] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:15] [INFO ] Deduced a trap composed of 9 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 16:16:15] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:15] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:15] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:15] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:15] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:16] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:17] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:17] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:17] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:17] [INFO ] Deduced a trap composed of 16 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 16:16:17] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:17] [INFO ] Deduced a trap composed of 16 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 16:16:17] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:17] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:17] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:18] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:18] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:18] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:18] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:18] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:18] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:19] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:19] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:19] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:19] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:21] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:21] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:21] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:22] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:22] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:22] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:22] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:22] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:23] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:23] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:23] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:23] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:23] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:23] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:24] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:24] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:24] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:24] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:24] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:24] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:27] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:28] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:28] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:28] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:28] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:29] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:29] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:30] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:30] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:30] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:30] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:30] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:31] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:31] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:31] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:31] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 10 ms to minimize.
SMT process timed out in 30179ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30181ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30914 ms. Remains : 242/242 places, 520/520 transitions.
[2025-06-02 16:16:31] [INFO ] Flatten gal took : 26 ms
[2025-06-02 16:16:31] [INFO ] Flatten gal took : 23 ms
[2025-06-02 16:16:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10411897811905205227.gal : 6 ms
[2025-06-02 16:16:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4295798257863204576.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10411897811905205227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4295798257863204576.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4295798257863204576.prop.
BEST_FIRST walk for 40002 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
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 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 152
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :152 after 778
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :778 after 1625
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1625 after 3386
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3386 after 11073
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :11073 after 71606
Interrupted probabilistic random walk after 586385 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 2
Probabilistic random walk after 586385 steps, saw 301699 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2025-06-02 16:16:34] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:16:34] [INFO ] Invariant cache hit.
[2025-06-02 16:16:34] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 40/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/610 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 356 constraints, problems are : Problem set: 0 solved, 2 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 40/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 2/358 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 16:16:35] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:35] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:35] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:35] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:36] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:36] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:36] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:36] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:36] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:36] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:37] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 11/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/369 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 16:16:37] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:37] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:37] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:37] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:38] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :71606 after 187328
[2025-06-02 16:16:38] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:38] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:38] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:38] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:38] [INFO ] Deduced a trap composed of 7 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 16:16:38] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/610 variables, 11/380 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 16:16:38] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:39] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:39] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 3/383 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 16:16:39] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/610 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/610 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4595 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4861ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 456 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 520/520 transitions.
RANDOM walk for 40000 steps (8 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 523005 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 2
Probabilistic random walk after 523005 steps, saw 271458 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2025-06-02 16:16:43] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:16:43] [INFO ] Invariant cache hit.
[2025-06-02 16:16:43] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 40/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/610 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 356 constraints, problems are : Problem set: 0 solved, 2 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 40/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 2/358 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 16:16:43] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:44] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:44] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:44] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:44] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:44] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:45] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:45] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:45] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:45] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:45] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 11/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/369 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 16:16:45] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:46] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:46] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:46] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:46] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:46] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:46] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:47] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:47] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:47] [INFO ] Deduced a trap composed of 7 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 16:16:47] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/610 variables, 11/380 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 16:16:47] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 16 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :187328 after 2.90484e+06
[2025-06-02 16:16:47] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:47] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 16 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 3/383 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 16:16:47] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/610 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/610 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4594 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4868ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 285 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2025-06-02 16:16:48] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:48] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-06-02 16:16:48] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 16:16:49] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:16:49] [INFO ] Redundant transitions in 4 ms returned []
Running 512 sub problems to find dead transitions.
[2025-06-02 16:16:49] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 16:16:49] [INFO ] Invariant cache hit.
[2025-06-02 16:16:49] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:55] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:55] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:55] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:55] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:56] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:56] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:56] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:56] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:56] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:56] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:56] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:56] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:57] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:57] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:57] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:57] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:57] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:57] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:57] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:58] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:00] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:01] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 9 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 16:17:02] [INFO ] Deduced a trap composed of 9 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 16:17:02] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 41 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 16:17:02] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 65536
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :2.90484e+06 after 6.503e+06
[2025-06-02 16:17:02] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:04] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:04] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:04] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:04] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:04] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:04] [INFO ] Deduced a trap composed of 16 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 16:17:05] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:05] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:05] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:05] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:05] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:05] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:05] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:05] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:06] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:06] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:06] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:06] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:06] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:07] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:08] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:09] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:09] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:09] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:09] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:09] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:10] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:10] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:10] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:10] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:10] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:11] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:11] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:11] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:11] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:11] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:11] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:12] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:12] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:12] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:15] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:15] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:15] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:15] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:15] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:18] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:18] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:18] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:18] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:18] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:18] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:19] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:19] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/610 variables, and 171 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 97/97 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/134 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 37/171 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Detected timeout of ITS tools.
[2025-06-02 16:17:21] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:17:21] [INFO ] Applying decomposition
[2025-06-02 16:17:21] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5163943806847902513.txt' '-o' '/tmp/graph5163943806847902513.bin' '-w' '/tmp/graph5163943806847902513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5163943806847902513.bin' '-l' '-1' '-v' '-w' '/tmp/graph5163943806847902513.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:17:21] [INFO ] Decomposing Gal with order
[2025-06-02 16:17:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:17:21] [INFO ] Removed a total of 638 redundant transitions.
[2025-06-02 16:17:21] [INFO ] Flatten gal took : 69 ms
[2025-06-02 16:17:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 9 ms.
[2025-06-02 16:17:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13391139813852845344.gal : 7 ms
[2025-06-02 16:17:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1657330661712579118.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/ReachabilityCardinality13391139813852845344.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1657330661712579118.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/ReachabilityCardinality1657330661712579118.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 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 65
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :65 after 151
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 747
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :747 after 1454
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1454 after 3142
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3142 after 31871
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:23] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:24] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:24] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 13 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :31871 after 59620
[2025-06-02 16:17:24] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:24] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:24] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:27] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :59620 after 188502
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:31] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:31] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:31] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:31] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:31] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 13/204 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-06-02 16:17:37] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 11 ms to minimize.
SDD size :188502 after 2.85739e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:38] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:38] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:39] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:39] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:39] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:39] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:42] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 16/240 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:42] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:42] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:45] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:45] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:45] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:45] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:45] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:46] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:46] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:46] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:46] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:46] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:46] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:46] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:47] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:47] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:47] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:47] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 18/258 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/610 variables, and 258 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 184/184 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60942 ms. Remains : 242/242 places, 520/520 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 242 transition count 368
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 152 place count 242 transition count 304
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 336 place count 122 transition count 304
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 352 place count 114 transition count 296
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 368 place count 106 transition count 352
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 376 place count 106 transition count 344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 384 place count 98 transition count 344
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 98 transition count 344
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 98 transition count 344
Applied a total of 400 rules in 35 ms. Remains 98 /242 variables (removed 144) and now considering 344/520 (removed 176) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 344 rows 98 cols
[2025-06-02 16:17:49] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:17:49] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2025-06-02 16:17:49] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:17:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2025-06-02 16:17:49] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 16:17:49] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 16:17:49] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 16:17:49] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:17:49] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:17:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8215176063318959881.gal : 3 ms
[2025-06-02 16:17:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality580711140958303737.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8215176063318959881.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality580711140958303737.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality580711140958303737.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 14
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 139
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :139 after 157
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :157 after 216
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :216 after 1687
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1687 after 2373
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2373 after 7520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7520 after 19016
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :19016 after 283656
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :283656 after 1.82673e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.82673e+06 after 4.11974e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.85739e+06 after 4.66576e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.11974e+06 after 1.768e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.768e+07 after 4.24177e+07
Detected timeout of ITS tools.
[2025-06-02 16:18:04] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:18:04] [INFO ] Applying decomposition
[2025-06-02 16:18:04] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12442358350671605194.txt' '-o' '/tmp/graph12442358350671605194.bin' '-w' '/tmp/graph12442358350671605194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12442358350671605194.bin' '-l' '-1' '-v' '-w' '/tmp/graph12442358350671605194.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:18:04] [INFO ] Decomposing Gal with order
[2025-06-02 16:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:18:04] [INFO ] Removed a total of 403 redundant transitions.
[2025-06-02 16:18:04] [INFO ] Flatten gal took : 26 ms
[2025-06-02 16:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 6 ms.
[2025-06-02 16:18:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6235859291458641971.gal : 2 ms
[2025-06-02 16:18:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5102659913202155138.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6235859291458641971.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5102659913202155138.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 ...328
Loading property file /tmp/ReachabilityCardinality5102659913202155138.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 45
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :45 after 116
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :116 after 257
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :257 after 5024
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5024 after 8166
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8166 after 144626
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :144626 after 2.5475e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.5475e+06 after 1.3044e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.3044e+07 after 1.58578e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.58578e+08 after 3.22408e+08
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.24696e+09 after 2.27049e+09
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30616 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[8]
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-12 in 146433 ms.
[2025-06-02 16:18:19] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:18:19] [INFO ] Applying decomposition
[2025-06-02 16:18:19] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1711316624413390210.txt' '-o' '/tmp/graph1711316624413390210.bin' '-w' '/tmp/graph1711316624413390210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1711316624413390210.bin' '-l' '-1' '-v' '-w' '/tmp/graph1711316624413390210.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:18:20] [INFO ] Decomposing Gal with order
[2025-06-02 16:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:18:20] [INFO ] Removed a total of 833 redundant transitions.
[2025-06-02 16:18:20] [INFO ] Flatten gal took : 33 ms
[2025-06-02 16:18:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 8 ms.
[2025-06-02 16:18:20] [INFO ] Time to serialize gal into /tmp/UpperBounds4100770343985134036.gal : 4 ms
[2025-06-02 16:18:20] [INFO ] Time to serialize properties into /tmp/UpperBounds9462139978889002906.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4100770343985134036.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9462139978889002906.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds9462139978889002906.prop.
Detected timeout of ITS tools.
[2025-06-02 16:40:47] [INFO ] Applying decomposition
[2025-06-02 16:40:47] [INFO ] Flatten gal took : 357 ms
[2025-06-02 16:40:47] [INFO ] Decomposing Gal with order
[2025-06-02 16:40:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:40:48] [INFO ] Removed a total of 1348 redundant transitions.
[2025-06-02 16:40:48] [INFO ] Flatten gal took : 425 ms
[2025-06-02 16:40:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 101 ms.
[2025-06-02 16:40:48] [INFO ] Time to serialize gal into /tmp/UpperBounds4329977691470602055.gal : 39 ms
[2025-06-02 16:40:48] [INFO ] Time to serialize properties into /tmp/UpperBounds1646643999853287925.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4329977691470602055.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1646643999853287925.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds1646643999853287925.prop.
Detected timeout of ITS tools.
[2025-06-02 17:03:15] [INFO ] Flatten gal took : 329 ms
[2025-06-02 17:03:17] [INFO ] Input system was already deterministic with 520 transitions.
[2025-06-02 17:03:18] [INFO ] Transformed 242 places.
[2025-06-02 17:03:18] [INFO ] Transformed 520 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 17:03:18] [INFO ] Time to serialize gal into /tmp/UpperBounds11155495734150798371.gal : 11 ms
[2025-06-02 17:03:18] [INFO ] Time to serialize properties into /tmp/UpperBounds8626811909284585245.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/UpperBounds11155495734150798371.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8626811909284585245.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds8626811909284585245.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-8"
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-8, 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-174876423100645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 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 ;