About the Execution of ITS-Tools for LamportFastMutEx-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 636032.00 | 0.00 | 0.00 | FFFFFFFFFFTTFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423200683.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-PT-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423200683
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 189K 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 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 32K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 203K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 404K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 208K 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 booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748884284595
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 17:11:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 17:11:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:11:26] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-02 17:11:26] [INFO ] Transformed 217 places.
[2025-06-02 17:11:26] [INFO ] Transformed 420 transitions.
[2025-06-02 17:11:26] [INFO ] Found NUPN structural information;
[2025-06-02 17:11:26] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6]
[2025-06-02 17:11:26] [INFO ] Parsed PT model containing 217 places and 420 transitions and 1834 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 140 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 22 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-02 17:11:26] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2025-06-02 17:11:26] [INFO ] Computed 50 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:11:26] [INFO ] Implicit Places using invariants in 295 ms returned [110, 111, 113, 114, 115]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 334 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/176 places, 354/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 171/176 places, 354/354 transitions.
Support contains 140 out of 171 places after structural reductions.
[2025-06-02 17:11:26] [INFO ] Flatten gal took : 50 ms
[2025-06-02 17:11:27] [INFO ] Flatten gal took : 25 ms
[2025-06-02 17:11:27] [INFO ] Input system was already deterministic with 354 transitions.
Support contains 139 out of 171 places (down from 140) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1063 ms. (37 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
[2025-06-02 17:11:27] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 171 cols
[2025-06-02 17:11:27] [INFO ] Computed 45 invariants in 7 ms
[2025-06-02 17:11:27] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 139/145 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 139/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/409 variables, 145/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 42/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/435 variables, 26/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 26/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 8/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/435 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 429 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1205 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 171/171 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 139/145 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 139/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/409 variables, 145/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 42/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/435 variables, 26/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 26/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 8/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:29] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:29] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:29] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 3/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:29] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/435 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 748 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 171/171 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1991ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 354/354 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 171 transition count 349
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 166 transition count 349
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 160 transition count 343
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 160 transition count 342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 159 transition count 342
Applied a total of 24 rules in 55 ms. Remains 159 /171 variables (removed 12) and now considering 342/354 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 159/171 places, 342/354 transitions.
RANDOM walk for 40000 steps (8 resets) in 465 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1194703 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :0 out of 1
Probabilistic random walk after 1194703 steps, saw 390944 distinct states, run finished after 3009 ms. (steps per millisecond=397 ) properties seen :0
[2025-06-02 17:11:32] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 159 cols
[2025-06-02 17:11:32] [INFO ] Computed 45 invariants in 6 ms
[2025-06-02 17:11:32] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 127/133 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 127/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/385 variables, 133/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 42/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/411 variables, 26/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 26/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/411 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 405 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Domain max(s): 159/159 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 159/159 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 127/133 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 127/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/385 variables, 133/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 42/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/411 variables, 26/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 26/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:33] [INFO ] Deduced a trap composed of 18 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 17:11:33] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:33] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:33] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:33] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:33] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 9 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/411 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:34] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 10 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:34] [INFO ] Deduced a trap composed of 19 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 17:11:34] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:34] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:34] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/411 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/411 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1601 ms.
Refiners :[Domain max(s): 159/159 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 159/159 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1898ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 342/342 transitions.
Applied a total of 0 rules in 11 ms. Remains 159 /159 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 159/159 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 342/342 transitions.
Applied a total of 0 rules in 11 ms. Remains 159 /159 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2025-06-02 17:11:34] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-02 17:11:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:11:34] [INFO ] Implicit Places using invariants in 190 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/159 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 213 ms. Remains : 158/159 places, 342/342 transitions.
RANDOM walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1210985 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 1
Probabilistic random walk after 1210985 steps, saw 396088 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
[2025-06-02 17:11:38] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2025-06-02 17:11:38] [INFO ] Computed 44 invariants in 3 ms
[2025-06-02 17:11:38] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 126/132 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 126/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/384 variables, 132/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 36/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/410 variables, 26/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 26/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/410 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 126/132 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 126/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/384 variables, 132/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 36/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/410 variables, 26/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 26/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:38] [INFO ] Deduced a trap composed of 8 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 17:11:38] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:38] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:38] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/410 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 658 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 850ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 16 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2025-06-02 17:11:38] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-02 17:11:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:11:39] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-02 17:11:39] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-02 17:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:11:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 17:11:39] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:11:39] [INFO ] Redundant transitions in 20 ms returned []
Running 336 sub problems to find dead transitions.
[2025-06-02 17:11:39] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-02 17:11:39] [INFO ] Invariant cache hit.
[2025-06-02 17:11:39] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 44/202 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:40] [INFO ] Deduced a trap composed of 9 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 17:11:40] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:40] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:41] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 7 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:41] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 8 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:41] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 8 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 6 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:41] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:41] [INFO ] Deduced a trap composed of 8 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 17:11:41] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:41] [INFO ] Deduced a trap composed of 14 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 17:11:41] [INFO ] Deduced a trap composed of 14 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 17:11:41] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 7 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 11 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 17:11:42] [INFO ] Deduced a trap composed of 11 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 17:11:42] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 8 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/222 constraints. Problems are: Problem set: 23 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 8 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 17:11:42] [INFO ] Deduced a trap composed of 8 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 17:11:43] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 8 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 17:11:43] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 14 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 17:11:43] [INFO ] Deduced a trap composed of 14 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 17:11:43] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 4 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 9 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/242 constraints. Problems are: Problem set: 35 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:45] [INFO ] Deduced a trap composed of 31 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 17:11:46] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:46] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:46] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:46] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 3 ms to minimize.
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:46] [INFO ] Deduced a trap composed of 18 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 17:11:46] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:46] [INFO ] Deduced a trap composed of 15 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 17:11:46] [INFO ] Deduced a trap composed of 15 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 17:11:47] [INFO ] Deduced a trap composed of 15 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 17:11:47] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:47] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:47] [INFO ] Deduced a trap composed of 19 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 17:11:47] [INFO ] Deduced a trap composed of 19 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 17:11:47] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:47] [INFO ] Deduced a trap composed of 18 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 17:11:47] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:47] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:48] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:48] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 10 ms to minimize.
Problem TDEAD156 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/262 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:48] [INFO ] Deduced a trap composed of 14 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 17:11:48] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:49] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:49] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:49] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:49] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:49] [INFO ] Deduced a trap composed of 14 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 17:11:50] [INFO ] Deduced a trap composed of 14 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 17:11:50] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:50] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:50] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:50] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:50] [INFO ] Deduced a trap composed of 14 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 17:11:50] [INFO ] Deduced a trap composed of 19 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 17:11:50] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:51] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:51] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:51] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:51] [INFO ] Deduced a trap composed of 19 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 17:11:51] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/282 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:51] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:51] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:51] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:52] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:53] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:53] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 6/288 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:54] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:55] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:55] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:55] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:55] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:56] [INFO ] Deduced a trap composed of 18 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 17:11:56] [INFO ] Deduced a trap composed of 18 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 17:11:56] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:56] [INFO ] Deduced a trap composed of 20 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 17:11:56] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:56] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:56] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:57] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 13/301 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:58] [INFO ] Deduced a trap composed of 19 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 17:11:58] [INFO ] Deduced a trap composed of 14 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 17:11:58] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 3/304 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:59] [INFO ] Deduced a trap composed of 18 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 17:11:59] [INFO ] Deduced a trap composed of 18 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 17:11:59] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:00] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:00] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:00] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:00] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 7/311 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:02] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:03] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 2/313 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:04] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 1/314 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/314 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 13 (OVERLAPS) 252/410 variables, 158/472 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 36/508 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/410 variables, and 508 constraints, problems are : Problem set: 36 solved, 300 unsolved in 30027 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 112/112 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 8/160 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 85/245 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/245 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 6/158 variables, 36/281 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 6/287 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 27/314 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:12] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:12] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:12] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 3/317 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/317 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 252/410 variables, 158/475 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 36/511 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 300/811 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:24] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:24] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:24] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:25] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:25] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:25] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:25] [INFO ] Deduced a trap composed of 19 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 17:12:25] [INFO ] Deduced a trap composed of 18 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 17:12:25] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:26] [INFO ] Deduced a trap composed of 19 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 17:12:26] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:26] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:26] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:26] [INFO ] Deduced a trap composed of 14 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 17:12:27] [INFO ] Deduced a trap composed of 14 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 17:12:27] [INFO ] Deduced a trap composed of 14 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 17:12:27] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:27] [INFO ] Deduced a trap composed of 18 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 17:12:27] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:27] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 20/831 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:33] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:34] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:34] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 834 constraints, problems are : Problem set: 36 solved, 300 unsolved in 30020 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 300/336 constraints, Known Traps: 138/138 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 36 solved, 300 unsolved
Search for dead transitions found 36 dead transitions in 60165ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/158 places, 306/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:12:39] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60712 ms. Remains : 158/158 places, 306/342 transitions.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1291877 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :0 out of 1
Probabilistic random walk after 1291877 steps, saw 418084 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
[2025-06-02 17:12:42] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
// Phase 1: matrix 228 rows 158 cols
[2025-06-02 17:12:42] [INFO ] Computed 44 invariants in 6 ms
[2025-06-02 17:12:42] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 126/132 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 126/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 228/360 variables, 132/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 30/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/386 variables, 26/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 26/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 126/132 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 126/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 228/360 variables, 132/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 30/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/386 variables, 26/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 26/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:43] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:43] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/386 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2025-06-02 17:12:43] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2025-06-02 17:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:12:43] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-02 17:12:43] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2025-06-02 17:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:12:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 17:12:43] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:12:43] [INFO ] Redundant transitions in 5 ms returned []
Running 300 sub problems to find dead transitions.
[2025-06-02 17:12:43] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2025-06-02 17:12:43] [INFO ] Invariant cache hit.
[2025-06-02 17:12:43] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 6/158 variables, 36/196 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:47] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:47] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:47] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:47] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:47] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:47] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:47] [INFO ] Deduced a trap composed of 8 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 17:12:47] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:48] [INFO ] Deduced a trap composed of 8 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 17:12:48] [INFO ] Deduced a trap composed of 8 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 17:12:48] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:48] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:48] [INFO ] Deduced a trap composed of 9 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 17:12:48] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:48] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:48] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:48] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:48] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:48] [INFO ] Deduced a trap composed of 14 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 17:12:49] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:49] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:49] [INFO ] Deduced a trap composed of 14 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 17:12:49] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:49] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:49] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:49] [INFO ] Deduced a trap composed of 11 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 17:12:49] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:49] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:50] [INFO ] Deduced a trap composed of 11 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 17:12:50] [INFO ] Deduced a trap composed of 11 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 17:12:50] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:50] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:50] [INFO ] Deduced a trap composed of 31 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 17:12:50] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:50] [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 17:12:50] [INFO ] Deduced a trap composed of 10 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 17:12:50] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:51] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:51] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:52] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:52] [INFO ] Deduced a trap composed of 19 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 17:12:52] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:52] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:52] [INFO ] Deduced a trap composed of 19 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 17:12:52] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:52] [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 17:12:53] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:53] [INFO ] Deduced a trap composed of 14 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 17:12:53] [INFO ] Deduced a trap composed of 14 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 17:12:53] [INFO ] Deduced a trap composed of 14 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 17:12:53] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:53] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:53] [INFO ] Deduced a trap composed of 18 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 17:12:54] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:54] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:54] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:54] [INFO ] Deduced a trap composed of 14 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 17:12:54] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:54] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:55] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:55] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:55] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:55] [INFO ] Deduced a trap composed of 14 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 17:12:55] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:55] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:56] [INFO ] Deduced a trap composed of 19 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 17:12:56] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:56] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:56] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:56] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:56] [INFO ] Deduced a trap composed of 20 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 17:12:56] [INFO ] Deduced a trap composed of 20 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 17:12:56] [INFO ] Deduced a trap composed of 18 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 17:12:57] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:57] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:57] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:57] [INFO ] Deduced a trap composed of 19 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 17:12:57] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:57] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:58] [INFO ] Deduced a trap composed of 14 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 17:12:58] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:58] [INFO ] Deduced a trap composed of 19 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 17:12:59] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:59] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:59] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:59] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:59] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:00] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:01] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:02] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:02] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:02] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:03] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:05] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:07] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 15 (OVERLAPS) 228/386 variables, 158/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/386 variables, 30/486 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/386 variables, and 486 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 70/230 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 6/158 variables, 36/266 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 26/298 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:16] [INFO ] Deduced a trap composed of 18 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 17:13:16] [INFO ] Deduced a trap composed of 18 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 17:13:16] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:16] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:16] [INFO ] Deduced a trap composed of 14 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 17:13:16] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:16] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:16] [INFO ] Deduced a trap composed of 19 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 17:13:17] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 9/307 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:18] [INFO ] Deduced a trap composed of 19 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 17:13:19] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:19] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:19] [INFO ] Deduced a trap composed of 18 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 17:13:19] [INFO ] Deduced a trap composed of 18 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 17:13:19] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:20] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (OVERLAPS) 228/386 variables, 158/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 30/502 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 300/802 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:29] [INFO ] Deduced a trap composed of 14 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 17:13:29] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:33] [INFO ] Deduced a trap composed of 31 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 17:13:33] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:33] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:33] [INFO ] Deduced a trap composed of 14 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 17:13:34] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:34] [INFO ] Deduced a trap composed of 18 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 17:13:34] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 9/811 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:43] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 812 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 122/122 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60633 ms. Remains : 158/158 places, 306/306 transitions.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 6 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 48 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 165 transition count 348
Applied a total of 12 rules in 12 ms. Remains 165 /171 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2025-06-02 17:13:44] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 165 cols
[2025-06-02 17:13:44] [INFO ] Computed 45 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:13:44] [INFO ] Implicit Places using invariants in 126 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/171 places, 348/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 164/171 places, 348/354 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-00
Product exploration explored 100000 steps with 6109 reset in 409 ms.
Product exploration explored 100000 steps with 6122 reset in 310 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 62 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2025-06-02 17:13:45] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2025-06-02 17:13:45] [INFO ] Computed 44 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:13:46] [INFO ] [Real]Absence check using 44 positive place invariants in 387 ms returned sat
[2025-06-02 17:13:50] [INFO ] [Real]Absence check using state equation in 4402 ms returned sat
[2025-06-02 17:13:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:13:51] [INFO ] [Nat]Absence check using 44 positive place invariants in 87 ms returned sat
[2025-06-02 17:13:51] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2025-06-02 17:13:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 17:13:52] [INFO ] [Nat]Added 36 Read/Feed constraints in 80 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:52] [INFO ] Deduced a trap composed of 8 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 17:13:52] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:52] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:52] [INFO ] Deduced a trap composed of 8 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 17:13:52] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:52] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 5 ms to minimize.
[2025-06-02 17:13:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 543 ms
[2025-06-02 17:13:52] [INFO ] Computed and/alt/rep : 228/1200/228 causal constraints (skipped 24 transitions) in 20 ms.
[2025-06-02 17:13:53] [INFO ] Added : 182 causal constraints over 37 iterations in 1219 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 48 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2025-06-02 17:13:53] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2025-06-02 17:13:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:13:53] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 17:13:53] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2025-06-02 17:13:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:13:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 17:13:54] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:13:54] [INFO ] Redundant transitions in 7 ms returned []
Running 342 sub problems to find dead transitions.
[2025-06-02 17:13:54] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2025-06-02 17:13:54] [INFO ] Invariant cache hit.
[2025-06-02 17:13:54] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 44/208 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:55] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 7 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:55] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 7 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:55] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 7 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:55] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 6 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:55] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 8 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 6 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:55] [INFO ] Deduced a trap composed of 8 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 17:13:55] [INFO ] Deduced a trap composed of 8 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 17:13:56] [INFO ] Deduced a trap composed of 8 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 17:13:56] [INFO ] Deduced a trap composed of 8 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 17:13:56] [INFO ] Deduced a trap composed of 14 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 17:13:56] [INFO ] Deduced a trap composed of 14 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 17:13:56] [INFO ] Deduced a trap composed of 14 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 17:13:56] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:56] [INFO ] Deduced a trap composed of 12 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 17:13:56] [INFO ] Deduced a trap composed of 12 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 17:13:56] [INFO ] Deduced a trap composed of 12 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 17:13:56] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 8 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:57] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:57] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/228 constraints. Problems are: Problem set: 19 solved, 323 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:57] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:57] [INFO ] Deduced a trap composed of 14 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 17:13:57] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 5 ms to minimize.
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:57] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:57] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:58] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 7 ms to minimize.
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:58] [INFO ] Deduced a trap composed of 31 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 17:13:58] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:58] [INFO ] Deduced a trap composed of 14 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 17:13:58] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 8 ms to minimize.
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:58] [INFO ] Deduced a trap composed of 18 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 17:13:58] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:58] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:58] [INFO ] Deduced a trap composed of 19 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 17:13:58] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:13:59] [INFO ] Deduced a trap composed of 18 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 17:13:59] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 4 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/248 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:00] [INFO ] Deduced a trap composed of 14 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 17:14:00] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:01] [INFO ] Deduced a trap composed of 15 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 17:14:01] [INFO ] Deduced a trap composed of 15 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 17:14:01] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:01] [INFO ] Deduced a trap composed of 15 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 17:14:01] [INFO ] Deduced a trap composed of 15 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 17:14:01] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:01] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:01] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:01] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:01] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:01] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:02] [INFO ] Deduced a trap composed of 14 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 17:14:02] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:02] [INFO ] Deduced a trap composed of 14 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 17:14:02] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:02] [INFO ] Deduced a trap composed of 19 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 17:14:02] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:02] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/268 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:03] [INFO ] Deduced a trap composed of 19 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 17:14:03] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:03] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:04] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:04] [INFO ] Deduced a trap composed of 18 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 17:14:04] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:04] [INFO ] Deduced a trap composed of 19 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 17:14:04] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:04] [INFO ] Deduced a trap composed of 19 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 17:14:04] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:04] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:04] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:05] [INFO ] Deduced a trap composed of 19 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 17:14:05] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:05] [INFO ] Deduced a trap composed of 18 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 17:14:05] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 16/284 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:05] [INFO ] Deduced a trap composed of 18 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 17:14:05] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:05] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:06] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:06] [INFO ] Deduced a trap composed of 19 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 17:14:06] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:06] [INFO ] Deduced a trap composed of 19 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 17:14:06] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:06] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:06] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:06] [INFO ] Deduced a trap composed of 19 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 17:14:06] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:06] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:07] [INFO ] Deduced a trap composed of 19 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 17:14:07] [INFO ] Deduced a trap composed of 19 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 17:14:07] [INFO ] Deduced a trap composed of 19 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 17:14:07] [INFO ] Deduced a trap composed of 19 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 17:14:07] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:07] [INFO ] Deduced a trap composed of 14 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 17:14:08] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/304 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:09] [INFO ] Deduced a trap composed of 8 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 17:14:09] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:10] [INFO ] Deduced a trap composed of 14 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 17:14:10] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:10] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:11] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:11] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 7/311 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/311 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 258/422 variables, 164/475 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 36/511 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/511 constraints. Problems are: Problem set: 36 solved, 306 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 422/422 variables, and 511 constraints, problems are : Problem set: 36 solved, 306 unsolved in 30019 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 103/103 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 8/166 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 76/242 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/242 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 6/164 variables, 36/278 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 6/284 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 27/311 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:26] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:26] [INFO ] Deduced a trap composed of 18 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 17:14:26] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:27] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:27] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:27] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:27] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 7/318 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:28] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:28] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/320 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:30] [INFO ] Deduced a trap composed of 14 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 17:14:30] [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 17:14:31] [INFO ] Deduced a trap composed of 18 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 17:14:31] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:31] [INFO ] Deduced a trap composed of 18 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 17:14:31] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:31] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 7/327 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:33] [INFO ] Deduced a trap composed of 18 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 17:14:33] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:33] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:33] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/331 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:35] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/332 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/332 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 13 (OVERLAPS) 258/422 variables, 164/496 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 36/532 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 306/838 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:44] [INFO ] Deduced a trap composed of 14 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 17:14:45] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:45] [INFO ] Deduced a trap composed of 14 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 17:14:50] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:50] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:50] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:50] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:51] [INFO ] Deduced a trap composed of 19 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 17:14:51] [INFO ] Deduced a trap composed of 19 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 17:14:51] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:51] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:51] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:51] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 13/851 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 851 constraints, problems are : Problem set: 36 solved, 306 unsolved in 30021 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 306/342 constraints, Known Traps: 137/137 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 36 solved, 306 unsolved
Search for dead transitions found 36 dead transitions in 60103ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 164/164 places, 312/348 transitions.
Applied a total of 0 rules in 11 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:14:54] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 60549 ms. Remains : 164/164 places, 312/348 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 65 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2025-06-02 17:14:54] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
// Phase 1: matrix 234 rows 164 cols
[2025-06-02 17:14:54] [INFO ] Computed 44 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:14:55] [INFO ] [Real]Absence check using 44 positive place invariants in 128 ms returned sat
[2025-06-02 17:14:56] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2025-06-02 17:14:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:14:56] [INFO ] [Nat]Absence check using 44 positive place invariants in 92 ms returned sat
[2025-06-02 17:14:57] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2025-06-02 17:14:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 17:14:57] [INFO ] [Nat]Added 30 Read/Feed constraints in 29 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:57] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:57] [INFO ] Deduced a trap composed of 8 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 17:14:57] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:57] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:58] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:58] [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 17:14:58] [INFO ] Deduced a trap composed of 8 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 17:14:58] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:14:58] [INFO ] Deduced a trap composed of 12 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 17:14:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
[2025-06-02 17:14:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1004 ms
[2025-06-02 17:14:58] [INFO ] Computed and/alt/rep : 204/1056/204 causal constraints (skipped 24 transitions) in 16 ms.
[2025-06-02 17:14:59] [INFO ] Added : 162 causal constraints over 33 iterations in 910 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6174 reset in 238 ms.
Product exploration explored 100000 steps with 6143 reset in 256 ms.
Built C files in :
/tmp/ltsmin4234165795341042442
[2025-06-02 17:15:00] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2025-06-02 17:15:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:15:00] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2025-06-02 17:15:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:15:00] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2025-06-02 17:15:00] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:15:00] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4234165795341042442
Running compilation step : cd /tmp/ltsmin4234165795341042442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 798 ms.
Running link step : cd /tmp/ltsmin4234165795341042442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin4234165795341042442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6420078683572519193.hoa' '--buchi-type=spotba'
LTSmin run took 635 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-00 finished in 77330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((X(p1)&&p0)) U X(X(p2))))))'
Support contains 24 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-02 17:15:01] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 171 cols
[2025-06-02 17:15:01] [INFO ] Computed 45 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:15:01] [INFO ] Implicit Places using invariants in 142 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 170/171 places, 354/354 transitions.
Stuttering acceptance computed with spot in 517 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), false, false]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-01
Product exploration explored 100000 steps with 21220 reset in 284 ms.
Product exploration explored 100000 steps with 21272 reset in 285 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 9 factoid took 353 ms. Reduced automaton from 11 states, 42 edges and 3 AP (stutter sensitive) to 11 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 491 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), false, false]
Reduction of identical properties reduced properties to check from 13 to 10
RANDOM walk for 40000 steps (8 resets) in 378 ms. (105 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
[2025-06-02 17:15:03] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2025-06-02 17:15:03] [INFO ] Computed 44 invariants in 1 ms
[2025-06-02 17:15:03] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 24/434 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 19 ms.
Refiners :[Domain max(s): 0/170 constraints, Positive P Invariants (semi-flows): 0/44 constraints, State Equation: 0/170 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p0) p2)), (G (OR (NOT p0) p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (NOT (OR p1 p0 p2)))]
Knowledge based reduction with 11 factoid took 857 ms. Reduced automaton from 11 states, 42 edges and 3 AP (stutter sensitive) to 11 states, 33 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 514 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 516 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-02 17:15:05] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-02 17:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:15:06] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 17:15:06] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-02 17:15:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:15:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 17:15:06] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-06-02 17:15:06] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-02 17:15:06] [INFO ] Invariant cache hit.
[2025-06-02 17:15:06] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 44/214 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:07] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:07] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 8 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:07] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 6 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:07] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 7 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:07] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 8 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:08] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:08] [INFO ] Deduced a trap composed of 13 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 17:15:08] [INFO ] Deduced a trap composed of 13 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 17:15:08] [INFO ] Deduced a trap composed of 13 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 17:15:08] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:08] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:08] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:08] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:08] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:08] [INFO ] Deduced a trap composed of 18 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 17:15:08] [INFO ] Deduced a trap composed of 18 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 17:15:08] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/234 constraints. Problems are: Problem set: 18 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:09] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 3 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:11] [INFO ] Deduced a trap composed of 31 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 17:15:11] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 5 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/254 constraints. Problems are: Problem set: 35 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:12] [INFO ] Deduced a trap composed of 18 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 17:15:12] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:12] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:12] [INFO ] Deduced a trap composed of 18 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 17:15:12] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:12] [INFO ] Deduced a trap composed of 15 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 17:15:13] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:13] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:13] [INFO ] Deduced a trap composed of 15 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 17:15:13] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:13] [INFO ] Deduced a trap composed of 14 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 17:15:13] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:13] [INFO ] Deduced a trap composed of 15 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 17:15:14] [INFO ] Deduced a trap composed of 15 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 17:15:14] [INFO ] Deduced a trap composed of 15 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 17:15:14] [INFO ] Deduced a trap composed of 15 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 17:15:14] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:14] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 3 ms to minimize.
Problem TDEAD156 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/274 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:15] [INFO ] Deduced a trap composed of 15 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 17:15:15] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:15] [INFO ] Deduced a trap composed of 31 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 17:15:15] [INFO ] Deduced a trap composed of 31 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 17:15:15] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:16] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:16] [INFO ] Deduced a trap composed of 15 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 17:15:16] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:16] [INFO ] Deduced a trap composed of 15 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 17:15:16] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:16] [INFO ] Deduced a trap composed of 19 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 17:15:16] [INFO ] Deduced a trap composed of 19 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 17:15:16] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:16] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:16] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:17] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:17] [INFO ] Deduced a trap composed of 19 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 17:15:17] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:17] [INFO ] Deduced a trap composed of 20 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 17:15:17] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/294 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:18] [INFO ] Deduced a trap composed of 18 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 17:15:18] [INFO ] Deduced a trap composed of 18 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 17:15:18] [INFO ] Deduced a trap composed of 18 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 17:15:18] [INFO ] Deduced a trap composed of 15 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 17:15:19] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:19] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:19] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:19] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:19] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:19] [INFO ] Deduced a trap composed of 19 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 17:15:19] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:19] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:20] [INFO ] Deduced a trap composed of 20 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 17:15:20] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:20] [INFO ] Deduced a trap composed of 20 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 17:15:20] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 16/310 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:22] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/311 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:23] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/312 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/312 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 264/434 variables, 170/482 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 36/518 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:31] [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 17:15:31] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:31] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:31] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:31] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:31] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 6/524 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 524 constraints, problems are : Problem set: 36 solved, 312 unsolved in 30046 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 104/104 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 8/172 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 76/248 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/248 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 6/170 variables, 36/284 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 6/290 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 28/318 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:38] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:38] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:38] [INFO ] Deduced a trap composed of 20 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 17:15:38] [INFO ] Deduced a trap composed of 20 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 17:15:38] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:39] [INFO ] Deduced a trap composed of 20 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 17:15:40] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 7/325 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:40] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/326 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/326 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 264/434 variables, 170/496 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 36/532 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 312/844 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:53] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:53] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:58] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:58] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:15:58] [INFO ] Deduced a trap composed of 20 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 17:15:58] [INFO ] Deduced a trap composed of 20 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 17:15:58] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 7/851 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 851 constraints, problems are : Problem set: 36 solved, 312 unsolved in 30017 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 312/348 constraints, Known Traps: 119/119 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 36 solved, 312 unsolved
Search for dead transitions found 36 dead transitions in 60137ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 318/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60537 ms. Remains : 170/170 places, 318/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 308 ms. Reduced automaton from 11 states, 33 edges and 3 AP (stutter sensitive) to 11 states, 33 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 495 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
RANDOM walk for 13167 steps (2 resets) in 114 ms. (114 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F p1), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 6 factoid took 533 ms. Reduced automaton from 11 states, 33 edges and 3 AP (stutter sensitive) to 11 states, 33 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 510 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 523 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 552 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 21576 reset in 209 ms.
Product exploration explored 100000 steps with 21618 reset in 225 ms.
Built C files in :
/tmp/ltsmin6222700249735093635
[2025-06-02 17:16:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6222700249735093635
Running compilation step : cd /tmp/ltsmin6222700249735093635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 495 ms.
Running link step : cd /tmp/ltsmin6222700249735093635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6222700249735093635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14730063571059542502.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-01 finished in 69310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 354/354 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 171 transition count 349
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 166 transition count 349
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 160 transition count 343
Applied a total of 22 rules in 21 ms. Remains 160 /171 variables (removed 11) and now considering 343/354 (removed 11) transitions.
[2025-06-02 17:16:10] [INFO ] Flow matrix only has 253 transitions (discarded 90 similar events)
// Phase 1: matrix 253 rows 160 cols
[2025-06-02 17:16:10] [INFO ] Computed 45 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:11] [INFO ] Implicit Places using invariants in 148 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/171 places, 343/354 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 159 transition count 342
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 342
Applied a total of 2 rules in 7 ms. Remains 158 /159 variables (removed 1) and now considering 342/343 (removed 1) transitions.
[2025-06-02 17:16:11] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2025-06-02 17:16:11] [INFO ] Computed 44 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:11] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 17:16:11] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-02 17:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 17:16:11] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/171 places, 342/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 703 ms. Remains : 158/171 places, 342/354 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 221 ms.
Stack based approach found an accepted trace after 393 steps with 0 reset with depth 394 and stack size 394 in 1 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-02 finished in 984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(X(X(X((X(p1)&&G(p2)))))))||G((p2&&X(p1))))))'
Support contains 18 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-02 17:16:11] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 171 cols
[2025-06-02 17:16:11] [INFO ] Computed 45 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:12] [INFO ] Implicit Places using invariants in 173 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 188 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 170/171 places, 354/354 transitions.
Stuttering acceptance computed with spot in 2126 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 396 ms.
Product exploration explored 100000 steps with 0 reset in 669 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND (NOT p0) p2 p1)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p2 p1))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 432 ms. Reduced automaton from 40 states, 224 edges and 3 AP (stutter sensitive) to 40 states, 224 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2083 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 552 ms. (72 steps per ms) remains 5/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
[2025-06-02 17:16:18] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2025-06-02 17:16:18] [INFO ] Computed 44 invariants in 1 ms
[2025-06-02 17:16:18] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 2 (OVERLAPS) 126/144 variables, 36/54 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 126/180 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 264/408 variables, 144/324 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 36/360 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/360 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/434 variables, 26/386 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 26/412 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 8/420 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/420 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/434 variables, 0/420 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 420 constraints, problems are : Problem set: 2 solved, 3 unsolved in 208 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 126/144 variables, 36/54 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 126/180 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 264/408 variables, 144/324 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 36/360 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/360 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/434 variables, 26/386 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 26/412 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 8/420 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 3/423 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:18] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:19] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 2/425 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:19] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:19] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 2/427 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:19] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 1/428 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 0/428 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/434 variables, 0/428 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 428 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1217 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1446ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 18 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 7 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 164/170 places, 348/354 transitions.
RANDOM walk for 40000 steps (8 resets) in 329 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 829436 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 3
Probabilistic random walk after 829436 steps, saw 290449 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
[2025-06-02 17:16:23] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2025-06-02 17:16:23] [INFO ] Computed 44 invariants in 1 ms
[2025-06-02 17:16:23] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 120/138 variables, 36/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 120/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 258/396 variables, 138/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 36/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/422 variables, 26/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 26/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/422 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 408 constraints, problems are : Problem set: 0 solved, 3 unsolved in 202 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 120/138 variables, 36/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 120/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 258/396 variables, 138/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 36/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/422 variables, 26/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 26/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:23] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:23] [INFO ] Deduced a trap composed of 18 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 17:16:23] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:23] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/422 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 415 constraints, problems are : Problem set: 0 solved, 3 unsolved in 941 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1177ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 18 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 164/164 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2025-06-02 17:16:24] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2025-06-02 17:16:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:24] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-02 17:16:24] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2025-06-02 17:16:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 17:16:24] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:16:24] [INFO ] Redundant transitions in 1 ms returned []
Running 342 sub problems to find dead transitions.
[2025-06-02 17:16:24] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2025-06-02 17:16:24] [INFO ] Invariant cache hit.
[2025-06-02 17:16:24] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 44/208 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:26] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:26] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 7 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:26] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 8 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:26] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 6 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:26] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 8 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:26] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 6 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:26] [INFO ] Deduced a trap composed of 8 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 17:16:26] [INFO ] Deduced a trap composed of 8 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 17:16:26] [INFO ] Deduced a trap composed of 8 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 17:16:27] [INFO ] Deduced a trap composed of 8 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 17:16:27] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:27] [INFO ] Deduced a trap composed of 14 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 17:16:27] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:27] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:27] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:27] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:27] [INFO ] Deduced a trap composed of 12 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 17:16:28] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 7 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:28] [INFO ] Deduced a trap composed of 12 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 17:16:28] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/228 constraints. Problems are: Problem set: 19 solved, 323 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:28] [INFO ] Deduced a trap composed of 8 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 17:16:28] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:28] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 4 ms to minimize.
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:28] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:28] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:29] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:29] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:29] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:29] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 6 ms to minimize.
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:29] [INFO ] Deduced a trap composed of 31 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 17:16:29] [INFO ] Deduced a trap composed of 31 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 17:16:29] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:29] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 7 ms to minimize.
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:29] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:30] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:30] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:30] [INFO ] Deduced a trap composed of 19 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 17:16:30] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:30] [INFO ] Deduced a trap composed of 18 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 17:16:30] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 5 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/248 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:32] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:32] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:32] [INFO ] Deduced a trap composed of 15 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 17:16:32] [INFO ] Deduced a trap composed of 15 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 17:16:32] [INFO ] Deduced a trap composed of 15 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 17:16:32] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:32] [INFO ] Deduced a trap composed of 15 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 17:16:32] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:33] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:33] [INFO ] Deduced a trap composed of 14 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 17:16:33] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:33] [INFO ] Deduced a trap composed of 14 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 17:16:33] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:33] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:33] [INFO ] Deduced a trap composed of 14 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 17:16:33] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:33] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:34] [INFO ] Deduced a trap composed of 19 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 17:16:34] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:34] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/268 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:34] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:35] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:35] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:35] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:35] [INFO ] Deduced a trap composed of 18 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 17:16:35] [INFO ] Deduced a trap composed of 18 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 17:16:36] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:36] [INFO ] Deduced a trap composed of 19 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 17:16:36] [INFO ] Deduced a trap composed of 19 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 17:16:36] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:36] [INFO ] Deduced a trap composed of 20 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 17:16:36] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:36] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:36] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:37] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:37] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 16/284 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:37] [INFO ] Deduced a trap composed of 18 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 17:16:37] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:37] [INFO ] Deduced a trap composed of 18 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 17:16:37] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:37] [INFO ] Deduced a trap composed of 19 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 17:16:38] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:38] [INFO ] Deduced a trap composed of 19 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 17:16:38] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:38] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:38] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:38] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:38] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:38] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:38] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:39] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:39] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:39] [INFO ] Deduced a trap composed of 19 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 17:16:39] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:39] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:39] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/304 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:41] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:41] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:41] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:42] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:42] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:42] [INFO ] Deduced a trap composed of 20 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 17:16:42] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 7/311 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/311 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 258/422 variables, 164/475 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 36/511 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/511 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/422 variables, and 511 constraints, problems are : Problem set: 36 solved, 306 unsolved in 30015 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 103/103 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 8/166 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 76/242 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/242 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 6/164 variables, 36/278 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 6/284 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 27/311 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:56] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:57] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:57] [INFO ] Deduced a trap composed of 14 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 17:16:57] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:58] [INFO ] Deduced a trap composed of 8 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 17:16:58] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:58] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 7/318 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:59] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:59] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/320 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:01] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:01] [INFO ] Deduced a trap composed of 14 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 17:17:01] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:01] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:02] [INFO ] Deduced a trap composed of 18 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 17:17:02] [INFO ] Deduced a trap composed of 18 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 17:17:02] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 7/327 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:03] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:03] [INFO ] Deduced a trap composed of 18 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 17:17:04] [INFO ] Deduced a trap composed of 19 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 17:17:04] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/331 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:05] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/332 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/332 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 13 (OVERLAPS) 258/422 variables, 164/496 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 36/532 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 306/838 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:15] [INFO ] Deduced a trap composed of 14 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 17:17:15] [INFO ] Deduced a trap composed of 14 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 17:17:15] [INFO ] Deduced a trap composed of 14 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 17:17:20] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:20] [INFO ] Deduced a trap composed of 19 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 17:17:20] [INFO ] Deduced a trap composed of 18 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 17:17:21] [INFO ] Deduced a trap composed of 18 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 17:17:21] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:21] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:21] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:21] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:21] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:21] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 13/851 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 851 constraints, problems are : Problem set: 36 solved, 306 unsolved in 30011 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 306/342 constraints, Known Traps: 137/137 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 36 solved, 306 unsolved
Search for dead transitions found 36 dead transitions in 60078ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/164 places, 312/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:17:25] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60698 ms. Remains : 164/164 places, 312/348 transitions.
RANDOM walk for 40000 steps (8 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 630152 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 3
Probabilistic random walk after 630152 steps, saw 232388 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
[2025-06-02 17:17:28] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
// Phase 1: matrix 234 rows 164 cols
[2025-06-02 17:17:28] [INFO ] Computed 44 invariants in 2 ms
[2025-06-02 17:17:28] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 120/138 variables, 36/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 120/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 234/372 variables, 138/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 30/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/398 variables, 26/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 26/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 8/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/398 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 402 constraints, problems are : Problem set: 0 solved, 3 unsolved in 222 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 120/138 variables, 36/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 120/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 234/372 variables, 138/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 30/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/398 variables, 26/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 26/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 8/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:28] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:28] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:29] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:29] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/398 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 409 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1031 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1263ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 18 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 164/164 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2025-06-02 17:17:29] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
[2025-06-02 17:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:17:29] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-02 17:17:29] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
[2025-06-02 17:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:17:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 17:17:29] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:17:29] [INFO ] Redundant transitions in 2 ms returned []
Running 306 sub problems to find dead transitions.
[2025-06-02 17:17:29] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
[2025-06-02 17:17:29] [INFO ] Invariant cache hit.
[2025-06-02 17:17:29] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 6/164 variables, 36/202 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:33] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:33] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:33] [INFO ] Deduced a trap composed of 8 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 17:17:33] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:33] [INFO ] Deduced a trap composed of 8 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 17:17:34] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:34] [INFO ] Deduced a trap composed of 13 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 17:17:34] [INFO ] Deduced a trap composed of 13 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 17:17:34] [INFO ] Deduced a trap composed of 13 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 17:17:34] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:34] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:34] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:34] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:34] [INFO ] Deduced a trap composed of 19 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 17:17:34] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:34] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:34] [INFO ] Deduced a trap composed of 18 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 17:17:35] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:35] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:35] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:35] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:35] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:35] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:35] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:35] [INFO ] Deduced a trap composed of 8 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 17:17:35] [INFO ] Deduced a trap composed of 19 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 17:17:35] [INFO ] Deduced a trap composed of 19 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 17:17:35] [INFO ] Deduced a trap composed of 19 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 17:17:36] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:36] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:36] [INFO ] Deduced a trap composed of 19 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 17:17:36] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:36] [INFO ] Deduced a trap composed of 18 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 17:17:36] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:36] [INFO ] Deduced a trap composed of 18 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 17:17:36] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:36] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:36] [INFO ] Deduced a trap composed of 12 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 17:17:37] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:37] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:38] [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 17:17:38] [INFO ] Deduced a trap composed of 31 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 17:17:38] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:38] [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 17:17:38] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:38] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:38] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:38] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:39] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:39] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:39] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:39] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:39] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:39] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:39] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:39] [INFO ] Deduced a trap composed of 14 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 17:17:39] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:40] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:40] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:40] [INFO ] Deduced a trap composed of 18 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 17:17:40] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:41] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:41] [INFO ] Deduced a trap composed of 14 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 17:17:41] [INFO ] Deduced a trap composed of 14 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 17:17:41] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:41] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:41] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:41] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:42] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:42] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:42] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:42] [INFO ] Deduced a trap composed of 14 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 17:17:42] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:42] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:42] [INFO ] Deduced a trap composed of 14 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 17:17:42] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:42] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 18/286 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:44] [INFO ] Deduced a trap composed of 19 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 17:17:44] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:44] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:44] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:44] [INFO ] Deduced a trap composed of 14 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 17:17:44] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:44] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:44] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:45] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:45] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 10/296 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:47] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:47] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:47] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:47] [INFO ] Deduced a trap composed of 14 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 17:17:47] [INFO ] Deduced a trap composed of 14 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 17:17:47] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 18 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 17:17:48] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 15/311 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:49] [INFO ] Deduced a trap composed of 8 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 17:17:49] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:50] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:51] [INFO ] Deduced a trap composed of 8 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 17:17:51] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:52] [INFO ] Deduced a trap composed of 14 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 17:17:52] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:54] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:55] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:55] [INFO ] Deduced a trap composed of 18 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 17:17:55] [INFO ] Deduced a trap composed of 18 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 17:17:55] [INFO ] Deduced a trap composed of 19 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 17:17:55] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:57] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:57] [INFO ] Deduced a trap composed of 14 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 17:17:57] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:58] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:59] [INFO ] Deduced a trap composed of 14 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 17:17:59] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:59] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:59] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 10 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 164/398 variables, and 332 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30015 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 0/164 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 124/124 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 95/261 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 6/164 variables, 36/297 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 29/332 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:02] [INFO ] Deduced a trap composed of 19 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 17:18:02] [INFO ] Deduced a trap composed of 19 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 17:18:02] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:03] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:03] [INFO ] Deduced a trap composed of 18 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 17:18:03] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:03] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:03] [INFO ] Deduced a trap composed of 19 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 17:18:03] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:04] [INFO ] Deduced a trap composed of 18 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 17:18:04] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:04] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:04] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:04] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:04] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 15/347 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:06] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:07] [INFO ] Deduced a trap composed of 18 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 17:18:07] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:08] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:08] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:08] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:09] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:10] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:10] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:10] [INFO ] Deduced a trap composed of 19 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 17:18:10] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 5/358 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:12] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:12] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:12] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:12] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:14] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:14] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:14] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:15] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:16] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:16] [INFO ] Deduced a trap composed of 19 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 17:18:16] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 3/369 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:18] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 17 (OVERLAPS) 234/398 variables, 164/534 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/398 variables, 30/564 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/398 variables, 306/870 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 870 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30014 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 162/162 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60526 ms. Remains : 164/164 places, 312/312 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND (NOT p0) p2 p1)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p2 p1))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) p2)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F p0)]
Knowledge based reduction with 17 factoid took 5258 ms. Reduced automaton from 40 states, 224 edges and 3 AP (stutter sensitive) to 40 states, 200 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2358 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 2276 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 18 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-02 17:18:39] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2025-06-02 17:18:39] [INFO ] Computed 44 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:18:40] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 17:18:40] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-02 17:18:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:18:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 17:18:40] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-06-02 17:18:40] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-02 17:18:40] [INFO ] Invariant cache hit.
[2025-06-02 17:18:40] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 44/214 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:41] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:41] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 8 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 7 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:41] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 7 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:42] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 8 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:42] [INFO ] Deduced a trap composed of 13 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 17:18:42] [INFO ] Deduced a trap composed of 13 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 17:18:42] [INFO ] Deduced a trap composed of 13 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 17:18:42] [INFO ] Deduced a trap composed of 13 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 17:18:42] [INFO ] Deduced a trap composed of 13 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 17:18:42] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:42] [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 17:18:42] [INFO ] Deduced a trap composed of 18 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 17:18:42] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:42] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:43] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:43] [INFO ] Deduced a trap composed of 18 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 17:18:43] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:43] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/234 constraints. Problems are: Problem set: 18 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:43] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:43] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:43] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:43] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 18 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 17:18:44] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 18 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 17:18:44] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:45] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:45] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 3 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:45] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:45] [INFO ] Deduced a trap composed of 31 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 17:18:45] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 4 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/254 constraints. Problems are: Problem set: 35 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:46] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:46] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:46] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:46] [INFO ] Deduced a trap composed of 18 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 17:18:46] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:46] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:46] [INFO ] Deduced a trap composed of 8 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 17:18:47] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:47] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:47] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:47] [INFO ] Deduced a trap composed of 15 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 17:18:47] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 3 ms to minimize.
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:48] [INFO ] Deduced a trap composed of 14 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 17:18:48] [INFO ] Deduced a trap composed of 14 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 17:18:48] [INFO ] Deduced a trap composed of 15 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 17:18:48] [INFO ] Deduced a trap composed of 15 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 17:18:48] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:48] [INFO ] Deduced a trap composed of 15 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 17:18:48] [INFO ] Deduced a trap composed of 15 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 17:18:48] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 3 ms to minimize.
Problem TDEAD156 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/274 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:49] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:49] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:49] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:50] [INFO ] Deduced a trap composed of 31 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 17:18:50] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:50] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:50] [INFO ] Deduced a trap composed of 15 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 17:18:50] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:50] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:50] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:50] [INFO ] Deduced a trap composed of 19 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 17:18:50] [INFO ] Deduced a trap composed of 19 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 17:18:51] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:51] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:51] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:51] [INFO ] Deduced a trap composed of 20 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 17:18:51] [INFO ] Deduced a trap composed of 19 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 17:18:51] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:51] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:51] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/294 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:52] [INFO ] Deduced a trap composed of 18 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 17:18:52] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:52] [INFO ] Deduced a trap composed of 18 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 17:18:53] [INFO ] Deduced a trap composed of 15 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 17:18:53] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:53] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:53] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:53] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:53] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:53] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:54] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:54] [INFO ] Deduced a trap composed of 21 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 17:18:54] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:54] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:54] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:54] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 16/310 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:56] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/311 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:57] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/312 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/312 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 264/434 variables, 170/482 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 36/518 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:04] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:05] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:05] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:05] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:05] [INFO ] Deduced a trap composed of 19 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 17:19:05] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 6/524 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 524 constraints, problems are : Problem set: 36 solved, 312 unsolved in 30014 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 104/104 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 8/172 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 76/248 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/248 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 6/170 variables, 36/284 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 6/290 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 28/318 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:12] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:12] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:12] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:12] [INFO ] Deduced a trap composed of 20 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 17:19:12] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:13] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:14] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 7/325 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:14] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/326 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/326 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 264/434 variables, 170/496 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 36/532 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 312/844 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:28] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:28] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:32] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:32] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:32] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:32] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:32] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 7/851 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 851 constraints, problems are : Problem set: 36 solved, 312 unsolved in 30023 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 312/348 constraints, Known Traps: 119/119 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 36 solved, 312 unsolved
Search for dead transitions found 36 dead transitions in 60089ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 318/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60575 ms. Remains : 170/170 places, 318/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 p1 p2))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 5045 ms. Reduced automaton from 40 states, 200 edges and 3 AP (stutter sensitive) to 40 states, 200 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2337 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
[2025-06-02 17:19:47] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
// Phase 1: matrix 240 rows 170 cols
[2025-06-02 17:19:48] [INFO ] Computed 44 invariants in 1 ms
[2025-06-02 17:19:48] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 132/144 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 132/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 240/384 variables, 144/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 30/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/410 variables, 26/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 26/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/410 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 414 constraints, problems are : Problem set: 0 solved, 2 unsolved in 174 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 30/30 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/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 132/144 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 132/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 240/384 variables, 144/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 30/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/410 variables, 26/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 26/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 2/416 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 17:19:48] [INFO ] Deduced a trap composed of 18 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 17:19:48] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/410 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 579 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 759ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 12 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 318/318 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 312
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 312
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 158 transition count 306
Applied a total of 24 rules in 7 ms. Remains 158 /170 variables (removed 12) and now considering 306/318 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/170 places, 306/318 transitions.
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 758750 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 2
Probabilistic random walk after 758750 steps, saw 269226 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2025-06-02 17:19:51] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
// Phase 1: matrix 228 rows 158 cols
[2025-06-02 17:19:51] [INFO ] Computed 44 invariants in 1 ms
[2025-06-02 17:19:51] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 120/132 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 120/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 228/360 variables, 132/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 30/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/386 variables, 26/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 26/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 390 constraints, problems are : Problem set: 0 solved, 2 unsolved in 176 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 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/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 120/132 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 120/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 228/360 variables, 132/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 30/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/386 variables, 26/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 26/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/392 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 17:19:52] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 6 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/386 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/386 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 393 constraints, problems are : Problem set: 0 solved, 2 unsolved in 522 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 707ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 12 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2025-06-02 17:19:52] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2025-06-02 17:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:19:52] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-02 17:19:52] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2025-06-02 17:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:19:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 17:19:53] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:19:53] [INFO ] Redundant transitions in 1 ms returned []
Running 300 sub problems to find dead transitions.
[2025-06-02 17:19:53] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2025-06-02 17:19:53] [INFO ] Invariant cache hit.
[2025-06-02 17:19:53] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 6/158 variables, 36/196 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:56] [INFO ] Deduced a trap composed of 8 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 17:19:56] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:56] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:56] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:56] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:56] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:57] [INFO ] Deduced a trap composed of 8 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 17:19:57] [INFO ] Deduced a trap composed of 8 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 17:19:57] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:57] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:57] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:57] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:57] [INFO ] Deduced a trap composed of 13 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 17:19:57] [INFO ] Deduced a trap composed of 13 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 17:19:57] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:57] [INFO ] Deduced a trap composed of 7 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 17:19:57] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:58] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:58] [INFO ] Deduced a trap composed of 11 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 17:19:58] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:58] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:58] [INFO ] Deduced a trap composed of 18 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 17:19:58] [INFO ] Deduced a trap composed of 9 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 17:19:58] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:58] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:59] [INFO ] Deduced a trap composed of 18 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 17:19:59] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:59] [INFO ] Deduced a trap composed of 19 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 17:19:59] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:59] [INFO ] Deduced a trap composed of 18 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 17:19:59] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:59] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:59] [INFO ] Deduced a trap composed of 11 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 17:19:59] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:59] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:00] [INFO ] Deduced a trap composed of 11 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 17:20:00] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:00] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:00] [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 17:20:00] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:01] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:01] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:01] [INFO ] Deduced a trap composed of 14 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 17:20:01] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:01] [INFO ] Deduced a trap composed of 19 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 17:20:02] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:02] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:02] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:02] [INFO ] Deduced a trap composed of 8 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 17:20:02] [INFO ] Deduced a trap composed of 7 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 17:20:02] [INFO ] Deduced a trap composed of 8 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 17:20:02] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:02] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:02] [INFO ] Deduced a trap composed of 18 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 17:20:03] [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 17:20:03] [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 17:20:03] [INFO ] Deduced a trap composed of 31 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 17:20:03] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:03] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:03] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:03] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:04] [INFO ] Deduced a trap composed of 14 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 17:20:04] [INFO ] Deduced a trap composed of 14 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 17:20:04] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:05] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:05] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:05] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:05] [INFO ] Deduced a trap composed of 18 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 17:20:05] [INFO ] Deduced a trap composed of 20 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 17:20:05] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:05] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:05] [INFO ] Deduced a trap composed of 19 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 17:20:05] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:06] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:06] [INFO ] Deduced a trap composed of 19 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 17:20:06] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:06] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:06] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:06] [INFO ] Deduced a trap composed of 14 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 17:20:06] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:07] [INFO ] Deduced a trap composed of 14 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 17:20:08] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:08] [INFO ] Deduced a trap composed of 19 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 17:20:08] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:08] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:08] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:08] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:08] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:08] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:09] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:09] [INFO ] Deduced a trap composed of 14 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 17:20:09] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:09] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:09] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:09] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:09] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:09] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 17/299 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:11] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:11] [INFO ] Deduced a trap composed of 18 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 17:20:11] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:11] [INFO ] Deduced a trap composed of 18 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 17:20:12] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:12] [INFO ] Deduced a trap composed of 19 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 17:20:12] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:14] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:14] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:14] [INFO ] Deduced a trap composed of 14 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 17:20:14] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:16] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:16] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:18] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:19] [INFO ] Deduced a trap composed of 18 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 17:20:19] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:20] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:20] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:20] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 300 unsolved
SMT process timed out in 30072ms, After SMT, problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 30073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30559 ms. Remains : 158/158 places, 306/306 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 158 transition count 228
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 78 place count 158 transition count 192
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 180 place count 92 transition count 192
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 192 place count 86 transition count 222
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 198 place count 86 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 204 place count 80 transition count 216
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 216 place count 80 transition count 216
Applied a total of 216 rules in 17 ms. Remains 80 /158 variables (removed 78) and now considering 216/306 (removed 90) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 216 rows 80 cols
[2025-06-02 17:20:23] [INFO ] Computed 14 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:20:23] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 17:20:23] [INFO ] After 110ms 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 17:20:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 17:20:23] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 17:20:23] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 17:20:23] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 307 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 p1 p2))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (AND (OR p0 p1) p2))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 5502 ms. Reduced automaton from 40 states, 200 edges and 3 AP (stutter sensitive) to 40 states, 200 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2068 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 2167 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 2065 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 306 ms.
Product exploration explored 100000 steps with 1 reset in 388 ms.
Built C files in :
/tmp/ltsmin1837033085212238952
[2025-06-02 17:20:41] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1837033085212238952
Running compilation step : cd /tmp/ltsmin1837033085212238952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 481 ms.
Running link step : cd /tmp/ltsmin1837033085212238952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1837033085212238952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11663532743321588310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 18 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 318/318 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2025-06-02 17:20:56] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
// Phase 1: matrix 240 rows 170 cols
[2025-06-02 17:20:56] [INFO ] Computed 44 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:56] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-02 17:20:56] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
[2025-06-02 17:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 17:20:56] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2025-06-02 17:20:56] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
[2025-06-02 17:20:56] [INFO ] Invariant cache hit.
[2025-06-02 17:20:56] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 6/170 variables, 36/208 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:00] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:00] [INFO ] Deduced a trap composed of 8 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 17:21:00] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:01] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:01] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:01] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:01] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:01] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:01] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:01] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:01] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:01] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:02] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:02] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:02] [INFO ] Deduced a trap composed of 13 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 17:21:02] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:02] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:02] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:02] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:02] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:02] [INFO ] Deduced a trap composed of 8 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 17:21:03] [INFO ] Deduced a trap composed of 18 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 17:21:03] [INFO ] Deduced a trap composed of 18 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 17:21:03] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:03] [INFO ] Deduced a trap composed of 18 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 17:21:03] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:03] [INFO ] Deduced a trap composed of 9 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 17:21:03] [INFO ] Deduced a trap composed of 8 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 17:21:03] [INFO ] Deduced a trap composed of 18 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 17:21:04] [INFO ] Deduced a trap composed of 31 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 17:21:04] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:04] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:04] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:04] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:04] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:05] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:05] [INFO ] Deduced a trap composed of 13 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 17:21:05] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:06] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:06] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:07] [INFO ] Deduced a trap composed of 14 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 17:21:07] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:07] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:07] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:07] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:07] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:07] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:07] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:09] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:10] [INFO ] Deduced a trap composed of 9 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 17:21:10] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:10] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:10] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:10] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:10] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:10] [INFO ] Deduced a trap composed of 21 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 17:21:10] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:10] [INFO ] Deduced a trap composed of 20 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 17:21:11] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:11] [INFO ] Deduced a trap composed of 20 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 17:21:11] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:11] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:11] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:11] [INFO ] Deduced a trap composed of 21 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 17:21:11] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:11] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:11] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:11] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:12] [INFO ] Deduced a trap composed of 9 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 17:21:13] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:13] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:13] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:15] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 12 (OVERLAPS) 240/410 variables, 170/469 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 30/499 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:24] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/410 variables, and 500 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30017 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 57/229 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 6/170 variables, 36/265 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 29/300 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:29] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:29] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:29] [INFO ] Deduced a trap composed of 19 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 17:21:29] [INFO ] Deduced a trap composed of 19 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 17:21:29] [INFO ] Deduced a trap composed of 19 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 17:21:29] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:31] [INFO ] Deduced a trap composed of 20 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 17:21:31] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:31] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:31] [INFO ] Deduced a trap composed of 15 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 17:21:31] [INFO ] Deduced a trap composed of 15 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 17:21:31] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:32] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:32] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:32] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:32] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:33] [INFO ] Deduced a trap composed of 19 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 17:21:33] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:33] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:33] [INFO ] Deduced a trap composed of 18 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 17:21:33] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:33] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:33] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:33] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 18/324 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:34] [INFO ] Deduced a trap composed of 18 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 17:21:34] [INFO ] Deduced a trap composed of 18 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 17:21:34] [INFO ] Deduced a trap composed of 18 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 17:21:34] [INFO ] Deduced a trap composed of 18 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 17:21:34] [INFO ] Deduced a trap composed of 20 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 17:21:36] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 11 (OVERLAPS) 240/410 variables, 170/500 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 30/530 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 312/842 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:45] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:45] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:45] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:49] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:51] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:51] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 6/848 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 848 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30021 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 170/170 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 122/122 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 60597 ms. Remains : 170/170 places, 318/318 transitions.
Built C files in :
/tmp/ltsmin4469981420588368545
[2025-06-02 17:21:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4469981420588368545
Running compilation step : cd /tmp/ltsmin4469981420588368545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 476 ms.
Running link step : cd /tmp/ltsmin4469981420588368545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4469981420588368545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2761957529159471020.hoa' '--buchi-type=spotba'
LTSmin run took 266 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-03 finished in 345887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((X(p1) U (p0&&X(p1))))) U (X(p2)&&F(p3))))'
Support contains 66 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-02 17:21:57] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 171 cols
[2025-06-02 17:21:57] [INFO ] Computed 45 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:21:57] [INFO ] Implicit Places using invariants in 170 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 354/354 transitions.
Applied a total of 0 rules in 0 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 170/171 places, 354/354 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p3), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 113 steps with 4 reset in 1 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-06 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))&&F((G(!p1)||(!p1&&G(F(!p2)))))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-02 17:21:58] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-02 17:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:21:58] [INFO ] Implicit Places using invariants in 189 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 170/171 places, 354/354 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, (AND p1 p2), (AND p1 p2), true]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1254 steps with 1 reset in 3 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-08 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&X(p2))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-02 17:21:58] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-02 17:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:21:58] [INFO ] Implicit Places using invariants in 145 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 156 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 170/171 places, 354/354 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 101 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-6-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-10 finished in 871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U G(p1)))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 354/354 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 171 transition count 349
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 166 transition count 349
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 161 transition count 344
Applied a total of 20 rules in 14 ms. Remains 161 /171 variables (removed 10) and now considering 344/354 (removed 10) transitions.
[2025-06-02 17:21:59] [INFO ] Flow matrix only has 254 transitions (discarded 90 similar events)
// Phase 1: matrix 254 rows 161 cols
[2025-06-02 17:21:59] [INFO ] Computed 45 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:21:59] [INFO ] Implicit Places using invariants in 213 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/171 places, 344/354 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 160 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 159 transition count 343
Applied a total of 2 rules in 7 ms. Remains 159 /160 variables (removed 1) and now considering 343/344 (removed 1) transitions.
[2025-06-02 17:21:59] [INFO ] Flow matrix only has 253 transitions (discarded 90 similar events)
// Phase 1: matrix 253 rows 159 cols
[2025-06-02 17:21:59] [INFO ] Computed 44 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:21:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 17:21:59] [INFO ] Flow matrix only has 253 transitions (discarded 90 similar events)
[2025-06-02 17:21:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:22:00] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 17:22:00] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 159/171 places, 343/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 716 ms. Remains : 159/171 places, 343/354 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), p0]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-14
Product exploration explored 100000 steps with 1811 reset in 201 ms.
Stack based approach found an accepted trace after 3135 steps with 51 reset with depth 136 and stack size 136 in 9 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-14 finished in 1011 ms.
All properties solved by simple procedures.
Total runtime 634610 ms.
BK_STOP 1748884920627
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-PT-6"
export BK_EXAMINATION="LTLCardinality"
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-PT-6, examination is LTLCardinality"
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-174876423200683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-6.tgz
mv LamportFastMutEx-PT-6 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;