About the Execution of ITS-Tools for Peterson-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFT?F?TF?F?FFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876813000636.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 Peterson-PT-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876813000636
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 196K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 781K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 195K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 870K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 318K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 157K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 553K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 714K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.8M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 904K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 43K 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 1.3M 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 Peterson-PT-7-LTLFireability-00
FORMULA_NAME Peterson-PT-7-LTLFireability-01
FORMULA_NAME Peterson-PT-7-LTLFireability-02
FORMULA_NAME Peterson-PT-7-LTLFireability-03
FORMULA_NAME Peterson-PT-7-LTLFireability-04
FORMULA_NAME Peterson-PT-7-LTLFireability-05
FORMULA_NAME Peterson-PT-7-LTLFireability-06
FORMULA_NAME Peterson-PT-7-LTLFireability-07
FORMULA_NAME Peterson-PT-7-LTLFireability-08
FORMULA_NAME Peterson-PT-7-LTLFireability-09
FORMULA_NAME Peterson-PT-7-LTLFireability-10
FORMULA_NAME Peterson-PT-7-LTLFireability-11
FORMULA_NAME Peterson-PT-7-LTLFireability-12
FORMULA_NAME Peterson-PT-7-LTLFireability-13
FORMULA_NAME Peterson-PT-7-LTLFireability-14
FORMULA_NAME Peterson-PT-7-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748956844902
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 13:20:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 13:20:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 13:20:46] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2025-06-03 13:20:46] [INFO ] Transformed 1992 places.
[2025-06-03 13:20:46] [INFO ] Transformed 3096 transitions.
[2025-06-03 13:20:46] [INFO ] Found NUPN structural information;
[2025-06-03 13:20:46] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Peterson-PT-7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1882 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 41 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:20:46] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-03 13:20:46] [INFO ] Computed 31 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:20:47] [INFO ] Implicit Places using invariants in 887 ms returned []
[2025-06-03 13:20:47] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:20:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:20:49] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:20:52] [INFO ] Implicit Places using invariants and state equation in 4411 ms returned []
Implicit Place search using SMT with State Equation took 5337 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2025-06-03 13:20:52] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:20:52] [INFO ] Invariant cache hit.
[2025-06-03 13:20:52] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31269ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31317ms
Finished structural reductions in LTL mode , in 1 iterations and 36750 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1882 out of 1992 places after structural reductions.
[2025-06-03 13:21:24] [INFO ] Flatten gal took : 388 ms
[2025-06-03 13:21:24] [INFO ] Flatten gal took : 247 ms
[2025-06-03 13:21:24] [INFO ] Input system was already deterministic with 3096 transitions.
Reduction of identical properties reduced properties to check from 33 to 27
RANDOM walk for 40000 steps (8 resets) in 5045 ms. (7 steps per ms) remains 8/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2049 ms. (19 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
[2025-06-03 13:21:27] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:21:27] [INFO ] Invariant cache hit.
[2025-06-03 13:21:27] [INFO ] State equation strengthened by 497 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1803/1977 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1977 variables, 1803/1993 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1977 variables, 0/1993 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 7/1984 variables, 7/2000 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1984 variables, 7/2007 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1984 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 8/1992 variables, 8/2015 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1992 variables, 8/2023 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1992/4752 variables, and 2023 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5027 ms.
Refiners :[Domain max(s): 1992/1992 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/1992 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1803/1977 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1977 variables, 1803/1993 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:35] [INFO ] Deduced a trap composed of 254 places in 1101 ms of which 293 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1977 variables, 1/1994 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:37] [INFO ] Deduced a trap composed of 254 places in 1123 ms of which 354 ms to minimize.
SMT process timed out in 10248ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 174 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 873 transitions
Trivial Post-agglo rules discarded 873 transitions
Performed 873 trivial Post agglomeration. Transition count delta: 873
Iterating post reduction 0 with 873 rules applied. Total rules applied 873 place count 1992 transition count 2223
Reduce places removed 873 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 876 rules applied. Total rules applied 1749 place count 1119 transition count 2220
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1752 place count 1116 transition count 2220
Performed 453 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 453 Pre rules applied. Total rules applied 1752 place count 1116 transition count 1767
Deduced a syphon composed of 453 places in 2 ms
Reduce places removed 453 places and 0 transitions.
Iterating global reduction 3 with 906 rules applied. Total rules applied 2658 place count 663 transition count 1767
Applied a total of 2658 rules in 333 ms. Remains 663 /1992 variables (removed 1329) and now considering 1767/3096 (removed 1329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 663/1992 places, 1767/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 1789 ms. (22 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2195 ms. (18 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 248130 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 7
Probabilistic random walk after 248130 steps, saw 46654 distinct states, run finished after 3005 ms. (steps per millisecond=82 ) properties seen :0
[2025-06-03 13:21:42] [INFO ] Flow matrix only has 1431 transitions (discarded 336 similar events)
// Phase 1: matrix 1431 rows 663 cols
[2025-06-03 13:21:42] [INFO ] Computed 31 invariants in 15 ms
[2025-06-03 13:21:42] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 474/648 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 474/664 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 7/655 variables, 7/671 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 7/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 8/663 variables, 8/686 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 8/694 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1431/2094 variables, 663/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2094 variables, 497/1854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2094 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/2094 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2094/2094 variables, and 1854 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3077 ms.
Refiners :[Domain max(s): 663/663 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 663/663 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 474/648 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 474/664 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:46] [INFO ] Deduced a trap composed of 86 places in 581 ms of which 290 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:47] [INFO ] Deduced a trap composed of 86 places in 287 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:47] [INFO ] Deduced a trap composed of 86 places in 262 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:47] [INFO ] Deduced a trap composed of 88 places in 320 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:48] [INFO ] Deduced a trap composed of 89 places in 292 ms of which 68 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 5/669 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:48] [INFO ] Deduced a trap composed of 86 places in 225 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:49] [INFO ] Deduced a trap composed of 86 places in 239 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:49] [INFO ] Deduced a trap composed of 87 places in 194 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:49] [INFO ] Deduced a trap composed of 86 places in 193 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:49] [INFO ] Deduced a trap composed of 86 places in 298 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:50] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:50] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 33 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 7/676 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:50] [INFO ] Deduced a trap composed of 86 places in 322 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:51] [INFO ] Deduced a trap composed of 90 places in 207 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:51] [INFO ] Deduced a trap composed of 91 places in 239 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:51] [INFO ] Deduced a trap composed of 86 places in 224 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:51] [INFO ] Deduced a trap composed of 89 places in 212 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:52] [INFO ] Deduced a trap composed of 88 places in 201 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:52] [INFO ] Deduced a trap composed of 86 places in 250 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:52] [INFO ] Deduced a trap composed of 86 places in 260 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:53] [INFO ] Deduced a trap composed of 86 places in 229 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:53] [INFO ] Deduced a trap composed of 86 places in 263 ms of which 64 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 10/686 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:53] [INFO ] Deduced a trap composed of 86 places in 252 ms of which 58 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:54] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:55] [INFO ] Deduced a trap composed of 88 places in 264 ms of which 56 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:55] [INFO ] Deduced a trap composed of 96 places in 416 ms of which 72 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:56] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:57] [INFO ] Deduced a trap composed of 89 places in 345 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:57] [INFO ] Deduced a trap composed of 86 places in 298 ms of which 72 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/648 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:58] [INFO ] Deduced a trap composed of 88 places in 230 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:58] [INFO ] Deduced a trap composed of 90 places in 361 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:58] [INFO ] Deduced a trap composed of 89 places in 281 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:59] [INFO ] Deduced a trap composed of 91 places in 257 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:59] [INFO ] Deduced a trap composed of 91 places in 252 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:59] [INFO ] Deduced a trap composed of 91 places in 235 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:00] [INFO ] Deduced a trap composed of 92 places in 527 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:00] [INFO ] Deduced a trap composed of 90 places in 300 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:00] [INFO ] Deduced a trap composed of 86 places in 277 ms of which 55 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 9/702 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:01] [INFO ] Deduced a trap composed of 86 places in 290 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:02] [INFO ] Deduced a trap composed of 91 places in 213 ms of which 48 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:02] [INFO ] Deduced a trap composed of 90 places in 197 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:03] [INFO ] Deduced a trap composed of 91 places in 212 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:03] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 42 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 3/707 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:04] [INFO ] Deduced a trap composed of 88 places in 219 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:04] [INFO ] Deduced a trap composed of 90 places in 238 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:04] [INFO ] Deduced a trap composed of 93 places in 291 ms of which 70 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 3/710 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:05] [INFO ] Deduced a trap composed of 88 places in 245 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:06] [INFO ] Deduced a trap composed of 88 places in 238 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:06] [INFO ] Deduced a trap composed of 88 places in 285 ms of which 57 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:07] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:07] [INFO ] Deduced a trap composed of 86 places in 261 ms of which 64 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/648 variables, 2/715 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/648 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 7/655 variables, 7/722 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/655 variables, 7/729 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/655 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 8/663 variables, 8/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/663 variables, 8/745 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:12] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:12] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:13] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:13] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:14] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:14] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:14] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:15] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:15] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:15] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:16] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:16] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:16] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:17] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:17] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:17] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:18] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:18] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:18] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:19] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 31 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/663 variables, 20/765 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:20] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:20] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:21] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:21] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:21] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:22] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:22] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:22] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:23] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:23] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:23] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:24] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:24] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:24] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:25] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:25] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:26] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:26] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:26] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:27] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 15 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/663 variables, 20/785 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:29] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:29] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:30] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:30] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:31] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/2094 variables, and 790 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45022 ms.
Refiners :[Domain max(s): 663/663 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/663 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48181ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 174 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 1767/1767 transitions.
Applied a total of 0 rules in 54 ms. Remains 663 /663 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 663/663 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 1767/1767 transitions.
Applied a total of 0 rules in 59 ms. Remains 663 /663 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2025-06-03 13:22:31] [INFO ] Flow matrix only has 1431 transitions (discarded 336 similar events)
[2025-06-03 13:22:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:22:32] [INFO ] Implicit Places using invariants in 909 ms returned [647, 648, 649, 650, 651, 660, 661, 662]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 916 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 655/663 places, 1767/1767 transitions.
Applied a total of 0 rules in 68 ms. Remains 655 /655 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1044 ms. Remains : 655/663 places, 1767/1767 transitions.
RANDOM walk for 40000 steps (8 resets) in 2230 ms. (17 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1952 ms. (20 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 280944 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 7
Probabilistic random walk after 280944 steps, saw 51100 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2025-06-03 13:22:36] [INFO ] Flow matrix only has 1431 transitions (discarded 336 similar events)
// Phase 1: matrix 1431 rows 655 cols
[2025-06-03 13:22:36] [INFO ] Computed 23 invariants in 5 ms
[2025-06-03 13:22:36] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 474/648 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 474/664 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 7/655 variables, 7/671 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 7/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1431/2086 variables, 655/1333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2086 variables, 497/1830 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2086 variables, 0/1830 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/2086 variables, 0/1830 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2086/2086 variables, and 1830 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2435 ms.
Refiners :[Domain max(s): 655/655 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 655/655 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 474/648 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 474/664 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:39] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:39] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:40] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:40] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:40] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:41] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:41] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:41] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:42] [INFO ] Deduced a trap composed of 31 places in 336 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:42] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:42] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:42] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:43] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:43] [INFO ] Deduced a trap composed of 42 places in 251 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:43] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:44] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:44] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:44] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:44] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:45] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 20/684 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:46] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:46] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:46] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:47] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:47] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:47] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:47] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:48] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:48] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:48] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:49] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:49] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:49] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:50] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:50] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:50] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:51] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:51] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:51] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:52] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:53] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:53] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:53] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:54] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:54] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:54] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:55] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:55] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:55] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:55] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:56] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:56] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:56] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:57] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:57] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:57] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:57] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:58] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:58] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:22:59] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 31 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 20/724 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:00] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:00] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:00] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:00] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:01] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:01] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:02] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:02] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:03] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:03] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:03] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:04] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:04] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:05] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:05] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:05] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:06] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:06] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:06] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:07] [INFO ] Deduced a trap composed of 23 places in 307 ms of which 27 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 20/744 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:08] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:08] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:08] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:09] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:09] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:09] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:10] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:10] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:10] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:11] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:11] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:11] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:12] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:12] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:12] [INFO ] Deduced a trap composed of 36 places in 317 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:13] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:13] [INFO ] Deduced a trap composed of 35 places in 266 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:13] [INFO ] Deduced a trap composed of 43 places in 241 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:14] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:14] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 35 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 20/764 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:16] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:16] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:16] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:17] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:17] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:17] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:18] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:18] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:18] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:18] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:19] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:19] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:19] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:20] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:20] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:20] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:21] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:21] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:21] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:22] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 32 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:24] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:24] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:24] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:24] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:25] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:25] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:25] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:25] [INFO ] Deduced a trap composed of 60 places in 164 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:26] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:26] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:26] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:26] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:27] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:27] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:27] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:27] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:27] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:28] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:28] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:28] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 28 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/648 variables, 20/804 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:31] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:32] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:32] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:33] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:33] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:33] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:33] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:34] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:34] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:35] [INFO ] Deduced a trap composed of 56 places in 213 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:35] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:36] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:36] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:37] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:38] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:38] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:38] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:39] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:39] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:39] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 29 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 20/824 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:43] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:43] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:43] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:43] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:44] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:44] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:44] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:44] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:45] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:46] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:46] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:46] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:47] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:47] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:48] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:49] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:49] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:50] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:51] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:51] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 33 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 20/844 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/2086 variables, and 844 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75015 ms.
Refiners :[Domain max(s): 648/655 constraints, Positive P Invariants (semi-flows): 16/23 constraints, State Equation: 0/655 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 180/180 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77477ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 174 out of 655 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 655/655 places, 1767/1767 transitions.
Applied a total of 0 rules in 67 ms. Remains 655 /655 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 655/655 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 655/655 places, 1767/1767 transitions.
Applied a total of 0 rules in 50 ms. Remains 655 /655 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2025-06-03 13:23:54] [INFO ] Flow matrix only has 1431 transitions (discarded 336 similar events)
[2025-06-03 13:23:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:23:54] [INFO ] Implicit Places using invariants in 707 ms returned []
[2025-06-03 13:23:54] [INFO ] Flow matrix only has 1431 transitions (discarded 336 similar events)
[2025-06-03 13:23:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:23:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:23:59] [INFO ] Implicit Places using invariants and state equation in 4620 ms returned []
Implicit Place search using SMT with State Equation took 5349 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:23:59] [INFO ] Redundant transitions in 193 ms returned []
Running 1759 sub problems to find dead transitions.
[2025-06-03 13:23:59] [INFO ] Flow matrix only has 1431 transitions (discarded 336 similar events)
[2025-06-03 13:23:59] [INFO ] Invariant cache hit.
[2025-06-03 13:23:59] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 23/678 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:17] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:17] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:18] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:18] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:18] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:19] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:19] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:19] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:20] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:20] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:20] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:20] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:21] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:21] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:21] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:21] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:22] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:22] [INFO ] Deduced a trap composed of 58 places in 219 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:22] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:22] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 20/698 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:24] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:24] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:25] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:25] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:25] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:26] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:26] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:26] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:26] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:26] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:27] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:27] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:27] [INFO ] Deduced a trap composed of 57 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:27] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:28] [INFO ] Deduced a trap composed of 57 places in 267 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:28] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:28] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:29] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:29] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:29] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/655 variables, 20/718 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 655/2086 variables, and 718 constraints, problems are : Problem set: 0 solved, 1759 unsolved in 30037 ms.
Refiners :[Domain max(s): 655/655 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/655 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1759/1759 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1759 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 23/678 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 40/718 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:33] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:34] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:34] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:34] [INFO ] Deduced a trap composed of 57 places in 208 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:34] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:35] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:35] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:35] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:36] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:36] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:36] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:36] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:37] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:37] [INFO ] Deduced a trap composed of 99 places in 211 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:37] [INFO ] Deduced a trap composed of 99 places in 191 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:37] [INFO ] Deduced a trap composed of 99 places in 197 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:37] [INFO ] Deduced a trap composed of 99 places in 192 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:38] [INFO ] Deduced a trap composed of 100 places in 187 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:38] [INFO ] Deduced a trap composed of 99 places in 189 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:38] [INFO ] Deduced a trap composed of 100 places in 216 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/655 variables, 20/738 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:40] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:40] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:41] [INFO ] Deduced a trap composed of 56 places in 200 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:41] [INFO ] Deduced a trap composed of 100 places in 183 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:41] [INFO ] Deduced a trap composed of 115 places in 197 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:41] [INFO ] Deduced a trap composed of 116 places in 193 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:42] [INFO ] Deduced a trap composed of 115 places in 175 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:42] [INFO ] Deduced a trap composed of 116 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:42] [INFO ] Deduced a trap composed of 115 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:42] [INFO ] Deduced a trap composed of 115 places in 178 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:42] [INFO ] Deduced a trap composed of 116 places in 171 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:43] [INFO ] Deduced a trap composed of 115 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:43] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:43] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:43] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:44] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:44] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:44] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:44] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:45] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 20/758 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:50] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:51] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:51] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:51] [INFO ] Deduced a trap composed of 20 places in 286 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:52] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:52] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:52] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:52] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:53] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:53] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:53] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:54] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:54] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:54] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:55] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:55] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:55] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:55] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:55] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:24:56] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 32 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 20/778 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/2086 variables, and 778 constraints, problems are : Problem set: 0 solved, 1759 unsolved in 30027 ms.
Refiners :[Domain max(s): 655/655 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/655 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1759 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 1759 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66113 ms. Remains : 655/655 places, 1767/1767 transitions.
Computed a total of 0 stabilizing places and 0 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' '!(((!p0 U G((p1 U !p2))) U (p1 U X(p3))))'
Support contains 896 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 98 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:25:00] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-03 13:25:01] [INFO ] Computed 31 invariants in 70 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:04] [INFO ] Implicit Places using invariants in 3303 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 3315 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 47 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3473 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 914 ms :[(NOT p3), (NOT p3), (AND p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), true, p2, p2, p2, p2]
Running random walk in product with property : Peterson-PT-7-LTLFireability-00
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 15 ms.
FORMULA Peterson-PT-7-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-00 finished in 4532 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((p0||G((X(X((X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))||p1))))))'
Support contains 136 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 93 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:25:05] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:08] [INFO ] Implicit Places using invariants in 3215 ms returned []
[2025-06-03 13:25:08] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:25:39] [INFO ] Performed 1243/1992 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:25:56] [INFO ] Implicit Places using invariants and state equation in 47969 ms returned []
Implicit Place search using SMT with State Equation took 51212 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2025-06-03 13:25:56] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:25:56] [INFO ] Invariant cache hit.
[2025-06-03 13:25:56] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31030ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31037ms
Finished structural reductions in LTL mode , in 1 iterations and 82348 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-03
Product exploration explored 100000 steps with 16564 reset in 649 ms.
Product exploration explored 100000 steps with 16241 reset in 596 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 8 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, true]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 1172 steps (0 resets) in 13 ms. (83 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR p2 (NOT p3)))), (F p3)]
Knowledge based reduction with 3 factoid took 329 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 8 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, true]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, true]
Support contains 136 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 58 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:26:30] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:26:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:26:33] [INFO ] Implicit Places using invariants in 3095 ms returned []
[2025-06-03 13:26:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:26:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:26:34] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:27:04] [INFO ] Performed 1245/1992 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:27:21] [INFO ] Implicit Places using invariants and state equation in 47386 ms returned []
Implicit Place search using SMT with State Equation took 50501 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2025-06-03 13:27:21] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:27:21] [INFO ] Invariant cache hit.
[2025-06-03 13:27:21] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 30960ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 30965ms
Finished structural reductions in LTL mode , in 1 iterations and 81530 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 8 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, true]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 1562 steps (0 resets) in 12 ms. (120 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR p2 (NOT p3)))), (F p3)]
Knowledge based reduction with 1 factoid took 253 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 8 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, true]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, true]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, true]
Product exploration explored 100000 steps with 16185 reset in 516 ms.
Product exploration explored 100000 steps with 16399 reset in 537 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, true]
Support contains 136 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 503 rules applied. Total rules applied 503 place count 1992 transition count 3096
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 393 Pre rules applied. Total rules applied 503 place count 1992 transition count 3390
Deduced a syphon composed of 896 places in 1 ms
Iterating global reduction 1 with 393 rules applied. Total rules applied 896 place count 1992 transition count 3390
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1099 place count 1789 transition count 3187
Deduced a syphon composed of 693 places in 1 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1302 place count 1789 transition count 3187
Performed 488 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1181 places in 2 ms
Iterating global reduction 1 with 488 rules applied. Total rules applied 1790 place count 1789 transition count 3187
Discarding 446 places :
Symmetric choice reduction at 1 with 446 rule applications. Total rules 2236 place count 1343 transition count 2741
Deduced a syphon composed of 735 places in 1 ms
Iterating global reduction 1 with 446 rules applied. Total rules applied 2682 place count 1343 transition count 2741
Deduced a syphon composed of 735 places in 1 ms
Applied a total of 2682 rules in 1105 ms. Remains 1343 /1992 variables (removed 649) and now considering 2741/3096 (removed 355) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:27:56] [INFO ] Redundant transitions in 143 ms returned []
Running 2733 sub problems to find dead transitions.
[2025-06-03 13:27:56] [INFO ] Flow matrix only has 2405 transitions (discarded 336 similar events)
// Phase 1: matrix 2405 rows 1343 cols
[2025-06-03 13:27:56] [INFO ] Computed 31 invariants in 8 ms
[2025-06-03 13:27:56] [INFO ] State equation strengthened by 791 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1335 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1335/3748 variables, and 7 constraints, problems are : Problem set: 0 solved, 2733 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/23 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/1343 constraints, ReadFeed: 0/791 constraints, PredecessorRefiner: 2733/2733 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2733 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1335 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2733 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 1335/3748 variables, and 7 constraints, problems are : Problem set: 0 solved, 2733 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/23 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/1343 constraints, ReadFeed: 0/791 constraints, PredecessorRefiner: 0/2733 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 2733 unsolved
Search for dead transitions found 0 dead transitions in 60904ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1992 places, 2741/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62177 ms. Remains : 1343/1992 places, 2741/3096 transitions.
Built C files in :
/tmp/ltsmin8689589990345670777
[2025-06-03 13:28:57] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8689589990345670777
Running compilation step : cd /tmp/ltsmin8689589990345670777;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8689589990345670777;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8689589990345670777;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 136 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 72 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:29:00] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-03 13:29:00] [INFO ] Computed 31 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:29:03] [INFO ] Implicit Places using invariants in 3184 ms returned []
[2025-06-03 13:29:03] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:29:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:29:04] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:29:34] [INFO ] Performed 1245/1992 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:29:51] [INFO ] Implicit Places using invariants and state equation in 47454 ms returned []
Implicit Place search using SMT with State Equation took 50657 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2025-06-03 13:29:51] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:29:51] [INFO ] Invariant cache hit.
[2025-06-03 13:29:51] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 30918ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 30923ms
Finished structural reductions in LTL mode , in 1 iterations and 81657 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Built C files in :
/tmp/ltsmin5423797940094048797
[2025-06-03 13:30:22] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5423797940094048797
Running compilation step : cd /tmp/ltsmin5423797940094048797;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5423797940094048797;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5423797940094048797;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 13:30:25] [INFO ] Flatten gal took : 153 ms
[2025-06-03 13:30:25] [INFO ] Flatten gal took : 154 ms
[2025-06-03 13:30:25] [INFO ] Time to serialize gal into /tmp/LTL5576788606081555025.gal : 71 ms
[2025-06-03 13:30:25] [INFO ] Time to serialize properties into /tmp/LTL3119338755394875481.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5576788606081555025.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17324679304067826477.hoa' '-atoms' '/tmp/LTL3119338755394875481.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3119338755394875481.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17324679304067826477.hoa
Detected timeout of ITS tools.
[2025-06-03 13:30:41] [INFO ] Flatten gal took : 68 ms
[2025-06-03 13:30:41] [INFO ] Flatten gal took : 70 ms
[2025-06-03 13:30:41] [INFO ] Time to serialize gal into /tmp/LTL1310980761297369912.gal : 11 ms
[2025-06-03 13:30:41] [INFO ] Time to serialize properties into /tmp/LTL15591102588634795298.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1310980761297369912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15591102588634795298.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(("(((((WantSection_1_F==1)&&(Idle_1==1))||((WantSection_7_F==1)&&(Idle_7==1)))||(((WantSection_0_F==1)&&(Idle_0==1))||((Want...5130
Formula 0 simplified : XX(!"((((((((TestTurn_1_1==0)||(Turn_1_1==0))&&((TestTurn_6_3==0)||(Turn_3_6==0)))&&(((TestTurn_7_2==0)||(Turn_2_7==0))&&((TestTurn_...5095
Detected timeout of ITS tools.
[2025-06-03 13:30:56] [INFO ] Flatten gal took : 64 ms
[2025-06-03 13:30:56] [INFO ] Applying decomposition
[2025-06-03 13:30:56] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4483313369415819052.txt' '-o' '/tmp/graph4483313369415819052.bin' '-w' '/tmp/graph4483313369415819052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4483313369415819052.bin' '-l' '-1' '-v' '-w' '/tmp/graph4483313369415819052.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:30:56] [INFO ] Decomposing Gal with order
[2025-06-03 13:30:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:30:57] [INFO ] Removed a total of 2833 redundant transitions.
[2025-06-03 13:30:58] [INFO ] Flatten gal took : 960 ms
[2025-06-03 13:30:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2025-06-03 13:30:58] [INFO ] Time to serialize gal into /tmp/LTL16973409692084409144.gal : 38 ms
[2025-06-03 13:30:58] [INFO ] Time to serialize properties into /tmp/LTL12130391742136353396.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16973409692084409144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12130391742136353396.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((G(("(((((i16.u217.WantSection_1_F==1)&&(i29.u387.Idle_1==1))||((i30.u423.WantSection_7_F==1)&&(i30.u423.Idle_7==1)))||(((i16.u...8004
Formula 0 simplified : XX(!"((((((((i26.i1.i0.i0.u490.TestTurn_1_1==0)||(i26.i1.i0.i0.u490.Turn_1_1==0))&&((i28.u178.TestTurn_6_3==0)||(i28.u178.Turn_3_6==...7969
Detected timeout of ITS tools.
Treatment of property Peterson-PT-7-LTLFireability-03 finished in 368338 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 U p1)&&G(p2)) U !X(!(G(p0)||p3))))'
Support contains 912 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 23 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:31:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:31:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:31:19] [INFO ] Implicit Places using invariants in 5376 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 5389 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 24 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5452 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 p2 (NOT p0) (NOT p3)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-04 finished in 5802 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 56 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 882 transitions
Trivial Post-agglo rules discarded 882 transitions
Performed 882 trivial Post agglomeration. Transition count delta: 882
Iterating post reduction 0 with 882 rules applied. Total rules applied 882 place count 1992 transition count 2214
Reduce places removed 882 places and 0 transitions.
Iterating post reduction 1 with 882 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Performed 455 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 455 Pre rules applied. Total rules applied 1764 place count 1110 transition count 1759
Deduced a syphon composed of 455 places in 1 ms
Reduce places removed 455 places and 0 transitions.
Iterating global reduction 2 with 910 rules applied. Total rules applied 2674 place count 655 transition count 1759
Applied a total of 2674 rules in 176 ms. Remains 655 /1992 variables (removed 1337) and now considering 1759/3096 (removed 1337) transitions.
[2025-06-03 13:31:19] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
// Phase 1: matrix 1423 rows 655 cols
[2025-06-03 13:31:19] [INFO ] Computed 31 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:31:20] [INFO ] Implicit Places using invariants in 1107 ms returned [639, 640, 641, 642, 643, 652, 653, 654]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1109 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 647/1992 places, 1759/3096 transitions.
Applied a total of 0 rules in 30 ms. Remains 647 /647 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1320 ms. Remains : 647/1992 places, 1759/3096 transitions.
Stuttering acceptance computed with spot in 58 ms :[p0]
Running random walk in product with property : Peterson-PT-7-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 511 ms.
Product exploration explored 100000 steps with 0 reset in 533 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p0]
RANDOM walk for 40000 steps (8 resets) in 339 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 702549 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 1
Probabilistic random walk after 702549 steps, saw 96012 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
[2025-06-03 13:31:25] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
// Phase 1: matrix 1423 rows 647 cols
[2025-06-03 13:31:25] [INFO ] Computed 23 invariants in 3 ms
[2025-06-03 13:31:25] [INFO ] State equation strengthened by 497 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/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 527/583 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 527/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/591 variables, 8/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/591 variables, 8/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/591 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1423/2014 variables, 591/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2014 variables, 497/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2014 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/2070 variables, 56/1751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2070 variables, 56/1807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2070 variables, 7/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2070 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2070 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2070/2070 variables, and 1814 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1138 ms.
Refiners :[Domain max(s): 647/647 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 647/647 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/0 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/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 527/583 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 527/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:26] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:27] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:27] [INFO ] Deduced a trap composed of 60 places in 271 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:27] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:27] [INFO ] Deduced a trap composed of 60 places in 222 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:28] [INFO ] Deduced a trap composed of 74 places in 243 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:28] [INFO ] Deduced a trap composed of 88 places in 225 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:28] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:28] [INFO ] Deduced a trap composed of 81 places in 227 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:28] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:29] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:29] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:29] [INFO ] Deduced a trap composed of 102 places in 217 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:29] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:30] [INFO ] Deduced a trap composed of 88 places in 206 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:30] [INFO ] Deduced a trap composed of 116 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:30] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 40 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 17/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:30] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:30] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:30] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 29 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 3/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:31] [INFO ] Deduced a trap composed of 102 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-03 13:31:31] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:31] [INFO ] Deduced a trap composed of 130 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-03 13:31:31] [INFO ] Deduced a trap composed of 123 places in 101 ms of which 9 ms to minimize.
SMT process timed out in 6280ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1759/1759 transitions.
Applied a total of 0 rules in 24 ms. Remains 647 /647 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 647/647 places, 1759/1759 transitions.
RANDOM walk for 40000 steps (8 resets) in 303 ms. (131 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 699300 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 699300 steps, saw 95684 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
[2025-06-03 13:31:34] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:31:34] [INFO ] Invariant cache hit.
[2025-06-03 13:31:34] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 527/583 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 527/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/591 variables, 8/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/591 variables, 8/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/591 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1423/2014 variables, 591/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2014 variables, 497/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2014 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/2070 variables, 56/1751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2070 variables, 56/1807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2070 variables, 7/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2070 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2070 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2070/2070 variables, and 1814 constraints, problems are : Problem set: 0 solved, 1 unsolved in 946 ms.
Refiners :[Domain max(s): 647/647 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 647/647 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/0 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/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 527/583 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 527/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:36] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:36] [INFO ] Deduced a trap composed of 53 places in 248 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:36] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:36] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:37] [INFO ] Deduced a trap composed of 74 places in 241 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:37] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:37] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:31:37] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 8/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/591 variables, 8/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/591 variables, 8/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1423/2014 variables, 591/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2014 variables, 497/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2014 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 56/2070 variables, 56/1759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2070 variables, 56/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2070 variables, 7/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2070 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2070 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2070/2070 variables, and 1822 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3053 ms.
Refiners :[Domain max(s): 647/647 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 647/647 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4032ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 56 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1759/1759 transitions.
Applied a total of 0 rules in 24 ms. Remains 647 /647 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 647/647 places, 1759/1759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1759/1759 transitions.
Applied a total of 0 rules in 25 ms. Remains 647 /647 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
[2025-06-03 13:31:38] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:31:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:31:39] [INFO ] Implicit Places using invariants in 942 ms returned []
[2025-06-03 13:31:39] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:31:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:31:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:31:45] [INFO ] Implicit Places using invariants and state equation in 5984 ms returned []
Implicit Place search using SMT with State Equation took 6960 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:31:45] [INFO ] Redundant transitions in 25 ms returned []
Running 1751 sub problems to find dead transitions.
[2025-06-03 13:31:45] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:31:45] [INFO ] Invariant cache hit.
[2025-06-03 13:31:45] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 647/647 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/647 variables, 23/670 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:03] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:03] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:04] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:04] [INFO ] Deduced a trap composed of 23 places in 341 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:04] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:04] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:05] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:05] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:05] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:05] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:06] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:06] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:06] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:06] [INFO ] Deduced a trap composed of 55 places in 261 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:07] [INFO ] Deduced a trap composed of 55 places in 248 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:07] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:07] [INFO ] Deduced a trap composed of 55 places in 260 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:08] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:08] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:08] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 20/690 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:10] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:10] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:10] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:11] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:11] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:11] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:11] [INFO ] Deduced a trap composed of 55 places in 239 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:12] [INFO ] Deduced a trap composed of 56 places in 259 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:12] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:12] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:12] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:13] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:13] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:13] [INFO ] Deduced a trap composed of 56 places in 213 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:13] [INFO ] Deduced a trap composed of 56 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:14] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:14] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:14] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:14] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:15] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 20/710 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 647/2070 variables, and 710 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30034 ms.
Refiners :[Domain max(s): 647/647 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/647 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1751/1751 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 647/647 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/647 variables, 23/670 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 40/710 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:20] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:20] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:20] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:21] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:21] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:21] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:22] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:22] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:22] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:22] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:23] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:23] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:23] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:23] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:24] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:24] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:24] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:24] [INFO ] Deduced a trap composed of 87 places in 204 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:25] [INFO ] Deduced a trap composed of 98 places in 196 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:25] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 20/730 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:28] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:28] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:28] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:28] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:29] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:29] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:29] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:30] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:30] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:30] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:30] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:31] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:31] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:31] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:31] [INFO ] Deduced a trap composed of 56 places in 197 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:32] [INFO ] Deduced a trap composed of 56 places in 208 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:32] [INFO ] Deduced a trap composed of 97 places in 189 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:32] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:32] [INFO ] Deduced a trap composed of 98 places in 209 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:32] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 20/750 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:35] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:36] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:36] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:36] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:36] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:37] [INFO ] Deduced a trap composed of 97 places in 193 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:37] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:37] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:37] [INFO ] Deduced a trap composed of 113 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:37] [INFO ] Deduced a trap composed of 113 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:38] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:38] [INFO ] Deduced a trap composed of 114 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:38] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:38] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:38] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:39] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:39] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:39] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:39] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:40] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 47 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/647 variables, 20/770 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:46] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:46] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 41 ms to minimize.
SMT process timed out in 60485ms, After SMT, problems are : Problem set: 0 solved, 1751 unsolved
Search for dead transitions found 0 dead transitions in 60488ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67507 ms. Remains : 647/647 places, 1759/1759 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1239 edges and 647 vertex of which 448 / 647 are part of one of the 56 SCC in 3 ms
Free SCC test removed 392 places
Drop transitions (Empty/Sink Transition effects.) removed 784 transitions
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 1120 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 232 transition count 673
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 55 place count 224 transition count 665
Graph (trivial) has 112 edges and 224 vertex of which 105 / 224 are part of one of the 8 SCC in 0 ms
Free SCC test removed 97 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 127 transition count 665
Drop transitions (Empty/Sink Transition effects.) removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 0 with 105 rules applied. Total rules applied 161 place count 127 transition count 560
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 1 with 49 rules applied. Total rules applied 210 place count 127 transition count 511
Graph (complete) has 567 edges and 127 vertex of which 71 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 211 place count 71 transition count 511
Drop transitions (Empty/Sink Transition effects.) removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 603 place count 71 transition count 119
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 610 place count 71 transition count 112
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 617 place count 64 transition count 112
Applied a total of 617 rules in 70 ms. Remains 64 /647 variables (removed 583) and now considering 112/1759 (removed 1647) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 112 rows 64 cols
[2025-06-03 13:32:46] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 13:32:46] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 13:32:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-03 13:32:46] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 13:32:46] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 13:32:46] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 259 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Support contains 56 out of 647 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 647/647 places, 1759/1759 transitions.
Applied a total of 0 rules in 36 ms. Remains 647 /647 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
[2025-06-03 13:32:46] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
// Phase 1: matrix 1423 rows 647 cols
[2025-06-03 13:32:46] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:32:47] [INFO ] Implicit Places using invariants in 1152 ms returned []
[2025-06-03 13:32:47] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:32:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:32:48] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:32:53] [INFO ] Implicit Places using invariants and state equation in 6021 ms returned []
Implicit Place search using SMT with State Equation took 7187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:32:53] [INFO ] Redundant transitions in 25 ms returned []
Running 1751 sub problems to find dead transitions.
[2025-06-03 13:32:53] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:32:53] [INFO ] Invariant cache hit.
[2025-06-03 13:32:53] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 647/647 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/647 variables, 23/670 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:11] [INFO ] Deduced a trap composed of 11 places in 402 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:11] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:12] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:12] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:12] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:13] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:13] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:13] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:13] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:14] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:14] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:14] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:14] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:15] [INFO ] Deduced a trap composed of 55 places in 253 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:15] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:15] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:15] [INFO ] Deduced a trap composed of 55 places in 264 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:16] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:16] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:16] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 20/690 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:18] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:18] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:18] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:19] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:19] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:19] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:19] [INFO ] Deduced a trap composed of 55 places in 233 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:20] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:20] [INFO ] Deduced a trap composed of 36 places in 271 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:20] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:20] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:21] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:21] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:21] [INFO ] Deduced a trap composed of 56 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:21] [INFO ] Deduced a trap composed of 56 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:22] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:22] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:22] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:22] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:23] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 20/710 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 647/2070 variables, and 710 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30035 ms.
Refiners :[Domain max(s): 647/647 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/647 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1751/1751 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 647/647 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/647 variables, 23/670 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 40/710 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:28] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:28] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:29] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:29] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:29] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:30] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:30] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:30] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:30] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:31] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:31] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:31] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:31] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:32] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:32] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:32] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:32] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:33] [INFO ] Deduced a trap composed of 87 places in 208 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:33] [INFO ] Deduced a trap composed of 98 places in 201 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:33] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 20/730 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:36] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:36] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:36] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:37] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:37] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:37] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:38] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:38] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:38] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:39] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:39] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:39] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:39] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:40] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:40] [INFO ] Deduced a trap composed of 56 places in 199 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:40] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:40] [INFO ] Deduced a trap composed of 97 places in 190 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:40] [INFO ] Deduced a trap composed of 98 places in 214 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:41] [INFO ] Deduced a trap composed of 98 places in 192 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:41] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 20/750 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:44] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:44] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:44] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:45] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:45] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:45] [INFO ] Deduced a trap composed of 97 places in 209 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:45] [INFO ] Deduced a trap composed of 113 places in 157 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:45] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:46] [INFO ] Deduced a trap composed of 113 places in 169 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:46] [INFO ] Deduced a trap composed of 113 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:46] [INFO ] Deduced a trap composed of 113 places in 168 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:46] [INFO ] Deduced a trap composed of 114 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:46] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:47] [INFO ] Deduced a trap composed of 113 places in 181 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:47] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:47] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:47] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:48] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:48] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:48] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 36 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/647 variables, 20/770 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:54] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 43 ms to minimize.
SMT process timed out in 60617ms, After SMT, problems are : Problem set: 0 solved, 1751 unsolved
Search for dead transitions found 0 dead transitions in 60620ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67875 ms. Remains : 647/647 places, 1759/1759 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
RANDOM walk for 40000 steps (8 resets) in 374 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 706302 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 1
Probabilistic random walk after 706302 steps, saw 96376 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
[2025-06-03 13:33:57] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:33:57] [INFO ] Invariant cache hit.
[2025-06-03 13:33:57] [INFO ] State equation strengthened by 497 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/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 527/583 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 527/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/591 variables, 8/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/591 variables, 8/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/591 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1423/2014 variables, 591/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2014 variables, 497/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2014 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/2070 variables, 56/1751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2070 variables, 56/1807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2070 variables, 7/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2070 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2070 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2070/2070 variables, and 1814 constraints, problems are : Problem set: 0 solved, 1 unsolved in 810 ms.
Refiners :[Domain max(s): 647/647 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 647/647 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/0 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/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 527/583 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 527/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:59] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:59] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:59] [INFO ] Deduced a trap composed of 60 places in 278 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:59] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:00] [INFO ] Deduced a trap composed of 74 places in 227 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:00] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:00] [INFO ] Deduced a trap composed of 88 places in 161 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:00] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 8/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/591 variables, 8/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/591 variables, 8/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1423/2014 variables, 591/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2014 variables, 497/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2014 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 56/2070 variables, 56/1759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2070 variables, 56/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2070 variables, 7/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2070 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2070 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2070/2070 variables, and 1822 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3021 ms.
Refiners :[Domain max(s): 647/647 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 647/647 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3890ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1785 steps, including 512 resets, run visited all 1 properties in 7 ms. (steps per millisecond=255 )
Parikh walk visited 1 properties in 17 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 30 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 458 ms.
Product exploration explored 100000 steps with 0 reset in 506 ms.
Built C files in :
/tmp/ltsmin738825521969407381
[2025-06-03 13:34:02] [INFO ] Too many transitions (1759) to apply POR reductions. Disabling POR matrices.
[2025-06-03 13:34:02] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin738825521969407381
Running compilation step : cd /tmp/ltsmin738825521969407381;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin738825521969407381;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin738825521969407381;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 56 out of 647 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 647/647 places, 1759/1759 transitions.
Applied a total of 0 rules in 42 ms. Remains 647 /647 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
[2025-06-03 13:34:06] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:07] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2025-06-03 13:34:07] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:34:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:07] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:34:13] [INFO ] Implicit Places using invariants and state equation in 6083 ms returned []
Implicit Place search using SMT with State Equation took 7188 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:34:13] [INFO ] Redundant transitions in 28 ms returned []
Running 1751 sub problems to find dead transitions.
[2025-06-03 13:34:13] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2025-06-03 13:34:13] [INFO ] Invariant cache hit.
[2025-06-03 13:34:13] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 647/647 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/647 variables, 23/670 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:30] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:30] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:31] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:31] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:31] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:31] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:32] [INFO ] Deduced a trap composed of 35 places in 276 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:32] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:32] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:33] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:33] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:33] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:33] [INFO ] Deduced a trap composed of 46 places in 235 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:34] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:34] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:34] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:34] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:35] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:35] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:35] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 20/690 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:37] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:37] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:37] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:38] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:38] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:38] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:38] [INFO ] Deduced a trap composed of 55 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:39] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:39] [INFO ] Deduced a trap composed of 36 places in 238 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:39] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:39] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:40] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:40] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:40] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:40] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:41] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:41] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:41] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:41] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:42] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 20/710 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 647/2070 variables, and 710 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30033 ms.
Refiners :[Domain max(s): 647/647 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/647 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1751/1751 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 647/647 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/647 variables, 23/670 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 40/710 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:47] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:48] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:48] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:48] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:48] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:49] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:49] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:49] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:50] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:50] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:50] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:50] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:51] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:51] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:51] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:52] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:52] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:52] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:52] [INFO ] Deduced a trap composed of 98 places in 210 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:52] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 20/730 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:55] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:55] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:56] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:56] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:56] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:57] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:57] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:57] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:57] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:58] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:58] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:58] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:59] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:59] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:59] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:59] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:00] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:00] [INFO ] Deduced a trap composed of 98 places in 186 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:00] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:00] [INFO ] Deduced a trap composed of 97 places in 190 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 20/750 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:03] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:03] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:04] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:04] [INFO ] Deduced a trap composed of 97 places in 208 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:04] [INFO ] Deduced a trap composed of 97 places in 201 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:04] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:05] [INFO ] Deduced a trap composed of 113 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:05] [INFO ] Deduced a trap composed of 114 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:05] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:05] [INFO ] Deduced a trap composed of 113 places in 205 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:05] [INFO ] Deduced a trap composed of 113 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:05] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:06] [INFO ] Deduced a trap composed of 114 places in 192 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:06] [INFO ] Deduced a trap composed of 113 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:06] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:06] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:07] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:07] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:07] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:07] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 36 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/647 variables, 20/770 constraints. Problems are: Problem set: 0 solved, 1751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:35:13] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 44 ms to minimize.
SMT process timed out in 60607ms, After SMT, problems are : Problem set: 0 solved, 1751 unsolved
Search for dead transitions found 0 dead transitions in 60610ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67885 ms. Remains : 647/647 places, 1759/1759 transitions.
Built C files in :
/tmp/ltsmin3915492283973234120
[2025-06-03 13:35:13] [INFO ] Too many transitions (1759) to apply POR reductions. Disabling POR matrices.
[2025-06-03 13:35:13] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3915492283973234120
Running compilation step : cd /tmp/ltsmin3915492283973234120;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3915492283973234120;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3915492283973234120;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 13:35:17] [INFO ] Flatten gal took : 56 ms
[2025-06-03 13:35:17] [INFO ] Flatten gal took : 53 ms
[2025-06-03 13:35:17] [INFO ] Time to serialize gal into /tmp/LTL5464695062158913793.gal : 11 ms
[2025-06-03 13:35:17] [INFO ] Time to serialize properties into /tmp/LTL758595802645668838.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5464695062158913793.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17545629078830256954.hoa' '-atoms' '/tmp/LTL758595802645668838.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL758595802645668838.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17545629078830256954.hoa
Detected timeout of ITS tools.
[2025-06-03 13:35:32] [INFO ] Flatten gal took : 33 ms
[2025-06-03 13:35:32] [INFO ] Flatten gal took : 34 ms
[2025-06-03 13:35:32] [INFO ] Time to serialize gal into /tmp/LTL17753642636164184478.gal : 5 ms
[2025-06-03 13:35:32] [INFO ] Time to serialize properties into /tmp/LTL7112768667319550385.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17753642636164184478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7112768667319550385.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((IsEndLoop_5_0_7==0)&&(IsEndLoop_7_0_7==0))&&((IsEndLoop_1_2_7==0)&&(IsEndLoop_3_2_7==0)))&&(((IsEndLoop_0_0_7==0)&&(IsE...1374
Formula 0 simplified : GF!"(((((((IsEndLoop_5_0_7==0)&&(IsEndLoop_7_0_7==0))&&((IsEndLoop_1_2_7==0)&&(IsEndLoop_3_2_7==0)))&&(((IsEndLoop_0_0_7==0)&&(IsEnd...1368
Detected timeout of ITS tools.
[2025-06-03 13:35:47] [INFO ] Flatten gal took : 33 ms
[2025-06-03 13:35:47] [INFO ] Applying decomposition
[2025-06-03 13:35:47] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8209038799729327130.txt' '-o' '/tmp/graph8209038799729327130.bin' '-w' '/tmp/graph8209038799729327130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8209038799729327130.bin' '-l' '-1' '-v' '-w' '/tmp/graph8209038799729327130.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:35:47] [INFO ] Decomposing Gal with order
[2025-06-03 13:35:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:35:47] [INFO ] Removed a total of 2496 redundant transitions.
[2025-06-03 13:35:47] [INFO ] Flatten gal took : 146 ms
[2025-06-03 13:35:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1015 labels/synchronizations in 156 ms.
[2025-06-03 13:35:47] [INFO ] Time to serialize gal into /tmp/LTL1651099935765411036.gal : 27 ms
[2025-06-03 13:35:47] [INFO ] Time to serialize properties into /tmp/LTL2274669292038419971.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1651099935765411036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2274669292038419971.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((i10.u49.IsEndLoop_5_0_7==0)&&(i10.u0.IsEndLoop_7_0_7==0))&&((i2.u12.IsEndLoop_1_2_7==0)&&(i9.u11.IsEndLoop_3_2_7==0)))&...1866
Formula 0 simplified : GF!"(((((((i10.u49.IsEndLoop_5_0_7==0)&&(i10.u0.IsEndLoop_7_0_7==0))&&((i2.u12.IsEndLoop_1_2_7==0)&&(i9.u11.IsEndLoop_3_2_7==0)))&&(...1860
Detected timeout of ITS tools.
Treatment of property Peterson-PT-7-LTLFireability-05 finished in 283570 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((p0&&F(p1)))||G((G(p3)||p2))) U X(!p4)))'
Support contains 528 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 35 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:36:03] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-03 13:36:03] [INFO ] Computed 31 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:36:08] [INFO ] Implicit Places using invariants in 5342 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 5364 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 35 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5437 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 392 ms :[p4, (OR (AND (NOT p0) p4) (AND (NOT p1) p4)), p4, (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p1) (NOT p3) p4)), (OR (AND (NOT p0) (NOT p2) (NOT p3) p4) (AND (NOT p1) (NOT p2) (NOT p3) p4)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 2826 ms.
Product exploration explored 100000 steps with 50000 reset in 2777 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p4) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p4 (NOT p0)))), (X (NOT p4)), (X (NOT (AND p4 (NOT p0)))), (X (NOT (AND p2 p4 p0 (NOT p1)))), (X (NOT (AND (NOT p3) p4 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3) p4 p0 (NOT p1)))), (X (NOT (AND p2 p4 (NOT p0)))), (X (NOT (AND (NOT p2) p3 p4 p0 (NOT p1)))), (X (NOT (AND p4 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3 p4 (NOT p0)))), (X (NOT (AND (NOT p3) p4 (NOT p0)))), (X (NOT (AND p2 p4))), (X (NOT (AND (NOT p2) (NOT p3) p4))), (X (NOT (AND p3 p4 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3 p4))), (X (NOT (AND (NOT p2) (NOT p3) p4 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p2 p4 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p4 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 p4 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 p4 (NOT p0))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) p4 (NOT p0))))), (X (X (NOT (AND p2 p4)))), (X (X (NOT (AND p3 p4 p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND p3 p4 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p4 (NOT p0))))), (X (X (NOT (AND (NOT p3) p4 p0 (NOT p1))))), (X (X (NOT (AND p2 p4 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p4 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND (NOT p2) p3 p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) p4 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 48 factoid took 19 ms. Reduced automaton from 11 states, 32 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-7-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-7-LTLFireability-06 finished in 11507 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((p0||X((G(p1) U (G(p1)&&p2)))))))'
Support contains 616 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 51 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:36:14] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:36:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:36:18] [INFO ] Implicit Places using invariants in 3446 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 3459 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 34 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3544 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-07
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-7-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-07 finished in 3738 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(p0))||G(p1))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 91 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
[2025-06-03 13:36:18] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 592 cols
[2025-06-03 13:36:18] [INFO ] Computed 31 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:36:19] [INFO ] Implicit Places using invariants in 975 ms returned [576, 577, 578, 579, 580, 589, 590, 591]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 989 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/1992 places, 1696/3096 transitions.
Applied a total of 0 rules in 23 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1103 ms. Remains : 584/1992 places, 1696/3096 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 255 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
[2025-06-03 13:36:20] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2025-06-03 13:36:20] [INFO ] Computed 23 invariants in 3 ms
[2025-06-03 13:36:20] [INFO ] State equation strengthened by 497 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/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/146 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/148 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 424/572 variables, 148/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 42/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 418/990 variables, 64/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 64/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 48/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/990 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 366/1356 variables, 6/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1356 variables, 366/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1356 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1362 variables, 6/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1362 variables, 6/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1362 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 582/1944 variables, 372/1281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1944 variables, 407/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 471 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/146 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/148 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 424/572 variables, 148/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 42/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 418/990 variables, 64/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 64/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 48/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:20] [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-03 13:36:21] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/990 variables, 2/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/990 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 366/1356 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1356 variables, 366/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:21] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:21] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:21] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:22] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:22] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:22] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 24 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1356 variables, 6/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1356 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1362 variables, 6/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1362 variables, 6/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1362 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1362 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 582/1944 variables, 372/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 407/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:23] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:23] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:24] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:24] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:24] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:24] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:25] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:25] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:25] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:25] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 28 ms to minimize.
SMT process timed out in 5660ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 26 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 34200 steps (7 resets) in 137 ms. (247 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 39 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-03 13:36:26] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:36:27] [INFO ] Implicit Places using invariants in 869 ms returned []
[2025-06-03 13:36:27] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:36:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:36:27] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:36:32] [INFO ] Implicit Places using invariants and state equation in 5041 ms returned []
Implicit Place search using SMT with State Equation took 5935 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:36:32] [INFO ] Redundant transitions in 25 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-03 13:36:32] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:36:32] [INFO ] Invariant cache hit.
[2025-06-03 13:36:32] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:48] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:48] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:48] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:49] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:49] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:49] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:49] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:50] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:50] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:50] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:50] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:50] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:51] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:51] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:51] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:51] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:52] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:52] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:52] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:52] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:54] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:54] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:54] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:54] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:55] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:55] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:55] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:55] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:56] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:56] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:56] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:56] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:57] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:57] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:57] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:57] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:58] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:58] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:58] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:36:59] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 33 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30026 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:06] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:06] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:06] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:06] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:06] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:07] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:07] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:07] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:07] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:08] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:08] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:09] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:09] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:09] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:10] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:10] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:10] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:10] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:10] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:11] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:13] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:13] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:13] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:13] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:14] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:14] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:14] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:14] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:14] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:15] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:15] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:15] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:15] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:15] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:15] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:16] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:16] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:16] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:16] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:16] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:20] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:20] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:21] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:21] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:22] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:22] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:22] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:23] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:24] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:24] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:24] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:24] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:26] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:26] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:26] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:26] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:26] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:27] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:27] [INFO ] Deduced a trap composed of 51 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:27] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/1944 variables, and 707 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30030 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1688 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66387 ms. Remains : 584/584 places, 1696/1696 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2025-06-03 13:37:33] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:37:33] [INFO ] Invariant cache hit.
[2025-06-03 13:37:33] [INFO ] State equation strengthened by 497 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/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/146 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/148 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 424/572 variables, 148/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 42/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 418/990 variables, 64/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 64/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 48/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/990 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 366/1356 variables, 6/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1356 variables, 366/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1356 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1362 variables, 6/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1362 variables, 6/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1362 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 582/1944 variables, 372/1281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1944 variables, 407/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 559 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/146 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/148 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 424/572 variables, 148/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 42/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 418/990 variables, 64/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 64/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 48/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:33] [INFO ] Deduced a trap composed of 13 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-03 13:37:34] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/990 variables, 2/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/990 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 366/1356 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1356 variables, 366/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:34] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:34] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:34] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:35] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 26 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1356 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1356 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1362 variables, 6/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1362 variables, 6/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1362 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:35] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:35] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:35] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 14 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1362 variables, 3/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1362 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 582/1944 variables, 372/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1944 variables, 407/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:36] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:36] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:37] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:37] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:37] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:37] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:38] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:38] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:38] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 25 ms to minimize.
SMT process timed out in 5802ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 22 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 763209 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 1
Probabilistic random walk after 763209 steps, saw 101645 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
[2025-06-03 13:37:41] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:37:41] [INFO ] Invariant cache hit.
[2025-06-03 13:37:41] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/146 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/148 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 424/572 variables, 148/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 42/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 418/990 variables, 64/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 64/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 48/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/990 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 366/1356 variables, 6/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1356 variables, 366/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1356 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1362 variables, 6/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1362 variables, 6/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1362 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 582/1944 variables, 372/1281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1944 variables, 407/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 619 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/146 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/148 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 424/572 variables, 148/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 42/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 418/990 variables, 64/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 64/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 48/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:42] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:43] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/990 variables, 2/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/990 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 366/1356 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1356 variables, 366/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:43] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:43] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:43] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:44] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 26 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1356 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1356 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1362 variables, 6/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1362 variables, 6/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1362 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:44] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:44] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:44] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 14 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1362 variables, 3/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1362 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 582/1944 variables, 372/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1944 variables, 407/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:45] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:45] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:46] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:46] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:46] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:46] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:47] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:47] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:47] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:47] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:48] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:48] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:48] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:48] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:49] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:49] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:49] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:50] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:50] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:50] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 26 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 20/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:50] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:51] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:51] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:51] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:51] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:52] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:52] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:52] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:52] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 27 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1944 variables, 9/1727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1944 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1944 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10762 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11427ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 191 ms.
Support contains 4 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 21 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 21 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-03 13:37:53] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:37:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:37:54] [INFO ] Implicit Places using invariants in 822 ms returned []
[2025-06-03 13:37:54] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:37:54] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:37:59] [INFO ] Implicit Places using invariants and state equation in 5183 ms returned []
Implicit Place search using SMT with State Equation took 6030 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:37:59] [INFO ] Redundant transitions in 24 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-03 13:37:59] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:37:59] [INFO ] Invariant cache hit.
[2025-06-03 13:37:59] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:15] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:15] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:15] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:15] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:16] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:16] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:16] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:16] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:17] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:17] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:17] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:17] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:18] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:18] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:18] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:18] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:19] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:19] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:19] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:19] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:21] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:21] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:21] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:21] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:22] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:22] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:22] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:22] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:23] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:23] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:23] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:23] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:24] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:24] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:24] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:24] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:25] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:25] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:26] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:26] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30027 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:33] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:33] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:33] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:34] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:34] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:34] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:34] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:34] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:35] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:35] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:35] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:36] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:36] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:37] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:37] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:37] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:37] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:37] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:38] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:38] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:40] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:40] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:40] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:40] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:41] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:41] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:41] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:41] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:42] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:42] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:42] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:42] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:42] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:42] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:43] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:43] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:43] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:43] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:43] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:44] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:47] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:47] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:48] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:49] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:49] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:49] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:50] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:51] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:51] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:51] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:51] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:52] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:53] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:53] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:53] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:53] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:54] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:54] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:54] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:54] [INFO ] Deduced a trap composed of 51 places in 211 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/1944 variables, and 707 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30029 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1688 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66497 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1256 edges and 584 vertex of which 432 / 584 are part of one of the 54 SCC in 1 ms
Free SCC test removed 378 places
Drop transitions (Empty/Sink Transition effects.) removed 756 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1146 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 206 transition count 496
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 152 transition count 496
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 133 place count 136 transition count 488
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 149 place count 128 transition count 480
Graph (trivial) has 68 edges and 128 vertex of which 42 / 128 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 156 place count 86 transition count 480
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 302 edges and 86 vertex of which 41 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 34 places
Iterating post reduction 0 with 43 rules applied. Total rules applied 199 place count 52 transition count 438
Drop transitions (Empty/Sink Transition effects.) removed 200 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 344 transitions.
Iterating post reduction 1 with 344 rules applied. Total rules applied 543 place count 52 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 557 place count 52 transition count 80
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 565 place count 52 transition count 72
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 575 place count 44 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 577 place count 42 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 579 place count 42 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 581 place count 42 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 583 place count 40 transition count 66
Applied a total of 583 rules in 31 ms. Remains 40 /584 variables (removed 544) and now considering 66/1696 (removed 1630) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 40 cols
[2025-06-03 13:39:00] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 13:39:00] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 13:39:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-03 13:39:00] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 13:39:00] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 13:39:00] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 164 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 217 ms.
Product exploration explored 100000 steps with 0 reset in 253 ms.
Built C files in :
/tmp/ltsmin5565885284980686760
[2025-06-03 13:39:01] [INFO ] Too many transitions (1696) to apply POR reductions. Disabling POR matrices.
[2025-06-03 13:39:01] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5565885284980686760
Running compilation step : cd /tmp/ltsmin5565885284980686760;'/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 2950 ms.
Running link step : cd /tmp/ltsmin5565885284980686760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin5565885284980686760;'/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/stateBased4713923257038903915.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 24 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-03 13:39:16] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2025-06-03 13:39:16] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:39:17] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2025-06-03 13:39:17] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:39:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:39:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:39:22] [INFO ] Implicit Places using invariants and state equation in 5016 ms returned []
Implicit Place search using SMT with State Equation took 6043 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:39:22] [INFO ] Redundant transitions in 24 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-03 13:39:22] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-03 13:39:22] [INFO ] Invariant cache hit.
[2025-06-03 13:39:22] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:37] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:38] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:38] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:38] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:38] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:39] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:39] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:39] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:39] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:40] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:40] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:40] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:40] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:41] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:41] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:41] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:41] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:41] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:42] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:42] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:43] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:44] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:44] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:44] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:44] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:45] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:45] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:45] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:45] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:46] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:46] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:46] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:46] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:46] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:47] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:47] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:47] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:47] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:48] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:48] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30033 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:56] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:56] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:56] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:56] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:56] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:57] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:57] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:57] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:57] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:58] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:58] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:58] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:59] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:59] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:59] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:00] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:00] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:00] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:00] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:01] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:02] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:03] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:03] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:03] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:03] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:04] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:04] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:04] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:04] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:04] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:05] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:05] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:05] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:05] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:05] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:05] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:06] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:06] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:06] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:06] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:10] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:10] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:11] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:11] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:12] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:12] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:12] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:13] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:14] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:14] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:14] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:14] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:16] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:16] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:16] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:16] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:16] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:17] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:17] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:17] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/1944 variables, and 707 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30043 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1688 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66539 ms. Remains : 584/584 places, 1696/1696 transitions.
Built C files in :
/tmp/ltsmin16624818071457582767
[2025-06-03 13:40:22] [INFO ] Too many transitions (1696) to apply POR reductions. Disabling POR matrices.
[2025-06-03 13:40:22] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16624818071457582767
Running compilation step : cd /tmp/ltsmin16624818071457582767;'/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 2968 ms.
Running link step : cd /tmp/ltsmin16624818071457582767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16624818071457582767;'/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/stateBased8286298996524955003.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 13:40:37] [INFO ] Flatten gal took : 34 ms
[2025-06-03 13:40:37] [INFO ] Flatten gal took : 33 ms
[2025-06-03 13:40:37] [INFO ] Time to serialize gal into /tmp/LTL9799017004832828200.gal : 5 ms
[2025-06-03 13:40:37] [INFO ] Time to serialize properties into /tmp/LTL6490838425284697099.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9799017004832828200.gal' '-t' 'CGAL' '-hoa' '/tmp/aut662863258175183659.hoa' '-atoms' '/tmp/LTL6490838425284697099.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6490838425284697099.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut662863258175183659.hoa
Detected timeout of ITS tools.
[2025-06-03 13:40:53] [INFO ] Flatten gal took : 32 ms
[2025-06-03 13:40:53] [INFO ] Flatten gal took : 33 ms
[2025-06-03 13:40:53] [INFO ] Time to serialize gal into /tmp/LTL15533531045789044078.gal : 5 ms
[2025-06-03 13:40:53] [INFO ] Time to serialize properties into /tmp/LTL6540996259580704425.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15533531045789044078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6540996259580704425.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((TestTurn_3_1==0)||(Turn_1_7==0))")))||(G("((TestTurn_1_5==0)||(Turn_5_1==0))")))))
Formula 0 simplified : G(FG!"((TestTurn_3_1==0)||(Turn_1_7==0))" & F!"((TestTurn_1_5==0)||(Turn_5_1==0))")
Detected timeout of ITS tools.
[2025-06-03 13:41:08] [INFO ] Flatten gal took : 32 ms
[2025-06-03 13:41:08] [INFO ] Applying decomposition
[2025-06-03 13:41:08] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14948574839020584652.txt' '-o' '/tmp/graph14948574839020584652.bin' '-w' '/tmp/graph14948574839020584652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14948574839020584652.bin' '-l' '-1' '-v' '-w' '/tmp/graph14948574839020584652.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:41:08] [INFO ] Decomposing Gal with order
[2025-06-03 13:41:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:41:08] [INFO ] Removed a total of 2496 redundant transitions.
[2025-06-03 13:41:08] [INFO ] Flatten gal took : 90 ms
[2025-06-03 13:41:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 894 labels/synchronizations in 67 ms.
[2025-06-03 13:41:08] [INFO ] Time to serialize gal into /tmp/LTL6431579690489841139.gal : 10 ms
[2025-06-03 13:41:08] [INFO ] Time to serialize properties into /tmp/LTL16011745248719622640.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6431579690489841139.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16011745248719622640.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i13.u9.TestTurn_3_1==0)||(i6.u11.Turn_1_7==0))")))||(G("((i12.i1.u41.TestTurn_1_5==0)||(i12.i0.u21.Turn_5_1==0))")))))
Formula 0 simplified : G(FG!"((i13.u9.TestTurn_3_1==0)||(i6.u11.Turn_1_7==0))" & F!"((i12.i1.u41.TestTurn_1_5==0)||(i12.i0.u21.Turn_5_1==0))")
Detected timeout of ITS tools.
Treatment of property Peterson-PT-7-LTLFireability-08 finished in 305377 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((p0 U (G((p0||G(p1)))||((p0||G(p1))&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))))))'
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 68 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:41:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-03 13:41:23] [INFO ] Computed 31 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:41:29] [INFO ] Implicit Places using invariants in 5637 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 5653 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 63 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5784 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 422 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p3 p2 (NOT p1)), (AND (NOT p1) (NOT p0) p2 p3), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (NOT p1), p2, (AND p2 p3), p3, (AND (NOT p1) p3)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 382 ms.
Product exploration explored 100000 steps with 0 reset in 409 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 136 ms. Reduced automaton from 13 states, 65 edges and 4 AP (stutter sensitive) to 13 states, 65 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), p3, (AND p3 p2), (AND (NOT p1) p3 p2), (AND (NOT p1) (NOT p0) p2 p3), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
RANDOM walk for 40000 steps (8 resets) in 565 ms. (70 steps per ms) remains 34/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
[2025-06-03 13:41:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2025-06-03 13:41:31] [INFO ] Computed 23 invariants in 6 ms
[2025-06-03 13:41:31] [INFO ] State equation strengthened by 497 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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 724/730 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/730 variables, 724/735 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/730 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 242/972 variables, 4/739 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/972 variables, 242/981 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/972 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1408/2380 variables, 972/1953 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2380 variables, 140/2093 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2380/4744 variables, and 2093 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5006 ms.
Refiners :[Domain max(s): 972/1984 constraints, Positive P Invariants (semi-flows): 9/23 constraints, State Equation: 972/1984 constraints, ReadFeed: 140/497 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 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, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem apf13 is UNSAT
Problem apf19 is UNSAT
Problem apf20 is UNSAT
Problem apf22 is UNSAT
Problem apf26 is UNSAT
Problem apf30 is UNSAT
At refinement iteration 2 (OVERLAPS) 724/730 variables, 5/11 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/730 variables, 724/735 constraints. Problems are: Problem set: 6 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:37] [INFO ] Deduced a trap composed of 221 places in 210 ms of which 38 ms to minimize.
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:37] [INFO ] Deduced a trap composed of 191 places in 280 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:38] [INFO ] Deduced a trap composed of 262 places in 244 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:38] [INFO ] Deduced a trap composed of 195 places in 278 ms of which 93 ms to minimize.
Problem apf14 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf35 is UNSAT
Problem apf40 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/730 variables, 4/739 constraints. Problems are: Problem set: 14 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 0/739 constraints. Problems are: Problem set: 14 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 242/972 variables, 4/743 constraints. Problems are: Problem set: 14 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/972 variables, 242/985 constraints. Problems are: Problem set: 14 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:40] [INFO ] Deduced a trap composed of 191 places in 389 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:41] [INFO ] Deduced a trap composed of 199 places in 295 ms of which 75 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/4744 variables, and 987 constraints, problems are : Problem set: 14 solved, 20 unsolved in 5018 ms.
Refiners :[Domain max(s): 972/1984 constraints, Positive P Invariants (semi-flows): 9/23 constraints, State Equation: 0/1984 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/34 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10075ms problems are : Problem set: 14 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 890 transitions
Trivial Post-agglo rules discarded 890 transitions
Performed 890 trivial Post agglomeration. Transition count delta: 890
Iterating post reduction 0 with 890 rules applied. Total rules applied 890 place count 1984 transition count 2206
Reduce places removed 890 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 892 rules applied. Total rules applied 1782 place count 1094 transition count 2204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1784 place count 1092 transition count 2204
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1784 place count 1092 transition count 1757
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2678 place count 645 transition count 1757
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2790 place count 589 transition count 1701
Applied a total of 2790 rules in 115 ms. Remains 589 /1984 variables (removed 1395) and now considering 1701/3096 (removed 1395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 589/1984 places, 1701/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 734 ms. (54 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 379872 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 20
Probabilistic random walk after 379872 steps, saw 59250 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2025-06-03 13:41:45] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
// Phase 1: matrix 1365 rows 589 cols
[2025-06-03 13:41:45] [INFO ] Computed 23 invariants in 3 ms
[2025-06-03 13:41:45] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 204/210 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 67/277 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 67/286 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 713/990 variables, 277/563 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/990 variables, 140/703 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/990 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 272/1262 variables, 56/759 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1262 variables, 56/815 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1262 variables, 6/821 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1262 variables, 24/845 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1262 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 252/1514 variables, 4/849 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1514 variables, 252/1101 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1514 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 4/1518 variables, 4/1105 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1518 variables, 4/1109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1518 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (OVERLAPS) 436/1954 variables, 256/1365 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1954 variables, 333/1698 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 20 unsolved in 6645 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 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, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 204/210 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:52] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 67/277 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 67/287 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:52] [INFO ] Deduced a trap composed of 60 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-03 13:41:52] [INFO ] Deduced a trap composed of 90 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-03 13:41:52] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 713/990 variables, 277/567 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/990 variables, 140/707 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 6/713 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 272/1262 variables, 56/769 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1262 variables, 56/825 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1262 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1262 variables, 24/855 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:55] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:55] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:55] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:55] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:56] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:56] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:56] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 7 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 7/862 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1262 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (OVERLAPS) 252/1514 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1514 variables, 252/1118 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:59] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:59] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:59] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:59] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:00] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:00] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:00] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:00] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:01] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:01] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:01] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:01] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:02] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:02] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:02] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:02] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:02] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:03] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:03] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:03] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 24 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1514 variables, 20/1138 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:04] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:04] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:04] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:05] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:05] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:05] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:05] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:06] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:06] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:06] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:06] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:07] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:07] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:07] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:07] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:08] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:08] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:08] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:09] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:09] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 25 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1514 variables, 20/1158 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:10] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:10] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:10] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:11] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:11] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:11] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:11] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:12] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:12] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:12] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:12] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:13] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:13] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:13] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:13] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:14] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:14] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:14] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:14] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:15] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 23 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1514 variables, 20/1178 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:16] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:16] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:16] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:16] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:17] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:17] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:17] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:17] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:17] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:18] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:18] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:18] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:18] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:19] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:19] [INFO ] Deduced a trap composed of 69 places in 179 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:19] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:19] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:19] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:20] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:20] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 27 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1514 variables, 20/1198 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:21] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:22] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:22] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:22] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:23] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:23] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:23] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:23] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:24] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:24] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:24] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 15 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1514 variables, 11/1209 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:25] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:26] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:26] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:26] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:26] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:27] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:27] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:27] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:27] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:28] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:28] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 22 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1514 variables, 11/1220 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1514 variables, 0/1220 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 29 (OVERLAPS) 4/1518 variables, 4/1224 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1518 variables, 4/1228 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1518 variables, 14/1242 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:33] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:34] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:34] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:34] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:34] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:35] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:35] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:35] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:35] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:36] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:36] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:36] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 21 ms to minimize.
SMT process timed out in 51783ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 3 properties in 742 ms.
Support contains 6 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 21 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 589/589 places, 1701/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 442 ms. (90 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 318879 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 17
Probabilistic random walk after 318879 steps, saw 53659 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2025-06-03 13:42:41] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2025-06-03 13:42:41] [INFO ] Invariant cache hit.
[2025-06-03 13:42:41] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 204/210 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 67/277 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 67/286 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 713/990 variables, 277/563 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/990 variables, 140/703 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/990 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 272/1262 variables, 56/759 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1262 variables, 56/815 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1262 variables, 6/821 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1262 variables, 24/845 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1262 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 252/1514 variables, 4/849 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1514 variables, 252/1101 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1514 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 4/1518 variables, 4/1105 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1518 variables, 4/1109 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1518 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 436/1954 variables, 256/1365 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1954 variables, 333/1698 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 17 unsolved in 4729 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 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, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 204/210 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:46] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:46] [INFO ] Deduced a trap composed of 90 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-03 13:42:46] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 67/277 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 67/289 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:46] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:46] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:47] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 713/990 variables, 277/569 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 140/709 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 5/714 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 272/1262 variables, 56/770 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1262 variables, 56/826 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1262 variables, 6/832 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 24/856 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:49] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:49] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:50] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:50] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:50] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:50] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:50] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:51] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:51] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:51] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:51] [INFO ] Deduced a trap composed of 67 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-03 13:42:51] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1262 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1262 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 252/1514 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1514 variables, 252/1124 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:54] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:54] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:54] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:54] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:55] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:55] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:55] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:55] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:55] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:56] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:56] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:56] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:56] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:56] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:57] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:57] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:57] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:57] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:58] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:58] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 24 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1514 variables, 20/1144 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:59] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:59] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:59] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:42:59] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:00] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:00] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:00] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:00] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:01] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:01] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:01] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:01] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:01] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:02] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:02] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:02] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:02] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:02] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:03] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:03] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 16 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1514 variables, 20/1164 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:04] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:04] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:04] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:05] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:05] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:05] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:06] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:06] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:06] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:06] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:07] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:07] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:07] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:08] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:08] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:08] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:08] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:09] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:09] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:09] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 24 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1514 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:10] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:10] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:11] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:11] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:11] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:11] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:12] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:12] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:12] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:12] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 23 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1514 variables, 10/1194 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1514 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (OVERLAPS) 4/1518 variables, 4/1198 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1518 variables, 4/1202 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1518 variables, 12/1214 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:18] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:19] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:19] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:19] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:19] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:20] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:20] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:20] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:20] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:21] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:21] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:21] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:21] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:22] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:22] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:22] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:23] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:23] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:23] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:24] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 18 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1518 variables, 20/1234 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:28] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:28] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:28] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:29] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:29] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:29] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:30] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:30] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:30] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:30] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:31] [INFO ] Deduced a trap composed of 22 places in 250 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:31] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:31] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:32] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:32] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:32] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:32] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:33] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:33] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:33] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 18 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1518 variables, 20/1254 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:36] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 21 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1518 variables, 1/1255 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1518 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (OVERLAPS) 436/1954 variables, 256/1511 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1954 variables, 333/1844 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1954 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (OVERLAPS) 0/1954 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1954/1954 variables, and 1844 constraints, problems are : Problem set: 0 solved, 17 unsolved in 68020 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 129/129 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72778ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 333 ms.
Support contains 6 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 24 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 589/589 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 21 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2025-06-03 13:43:54] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2025-06-03 13:43:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:43:55] [INFO ] Implicit Places using invariants in 828 ms returned []
[2025-06-03 13:43:55] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2025-06-03 13:43:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:43:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:44:00] [INFO ] Implicit Places using invariants and state equation in 5245 ms returned []
Implicit Place search using SMT with State Equation took 6081 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:44:00] [INFO ] Redundant transitions in 24 ms returned []
Running 1693 sub problems to find dead transitions.
[2025-06-03 13:44:00] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2025-06-03 13:44:00] [INFO ] Invariant cache hit.
[2025-06-03 13:44:00] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:16] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:16] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:16] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:17] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:17] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:17] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:17] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:18] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:18] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:18] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:18] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:19] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:19] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:19] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:19] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:20] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:20] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:20] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:20] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:21] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:22] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:22] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:23] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:23] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:23] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:23] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:24] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:24] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:24] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:24] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:25] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:25] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:25] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:25] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:26] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:26] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:26] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:26] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:27] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:27] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 20/652 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/1954 variables, and 652 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30043 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/589 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1693/1693 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 40/652 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:35] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:35] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:36] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:36] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:36] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:36] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:36] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:37] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:37] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:37] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:37] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:37] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:38] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:38] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:38] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:38] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:38] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:39] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:39] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:39] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 20/672 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:42] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:42] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:43] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:43] [INFO ] Deduced a trap composed of 70 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:43] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:43] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:44] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:44] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:44] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:44] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:44] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:45] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:45] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:45] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:45] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:45] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:46] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:46] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:46] [INFO ] Deduced a trap composed of 60 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:46] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 20/692 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:50] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:50] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:50] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:51] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:51] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:51] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:51] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:51] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:51] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:52] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:52] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:52] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:52] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:53] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:53] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:53] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:53] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:53] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:54] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:54] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 20/712 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:59] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:59] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:59] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:59] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:59] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:00] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:00] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:00] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:00] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 19 ms to minimize.
SMT process timed out in 60466ms, After SMT, problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66609 ms. Remains : 589/589 places, 1701/1701 transitions.
Found 14 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X p1)), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR p0 p1)), (G (OR p0 (NOT p1) (NOT p2))), (G (OR p0 p1 p2 (NOT p3))), (G (OR p1 (NOT p2) p3)), (G (OR p1 (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR p1 (NOT p2))), (G (OR p0 p1 p2 p3)), (G (OR p0 p1 (NOT p2))), (G (OR p0 p1 p3)), (G (OR p0 p1 (NOT p3))), (G (OR p0 p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3)))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND p1 (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT p1)), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (AND p1 (NOT p3))))]
Knowledge based reduction with 45 factoid took 693 ms. Reduced automaton from 13 states, 65 edges and 4 AP (stutter sensitive) to 13 states, 49 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), p3, (AND p3 p2), (AND (NOT p1) p3 p2), (AND (NOT p1) (NOT p0) p2 p3), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 430 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), p3, (AND p3 p2), (AND (NOT p1) p3 p2), (AND (NOT p1) (NOT p0) p2 p3), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 6 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 64 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:45:02] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2025-06-03 13:45:02] [INFO ] Computed 23 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:45:07] [INFO ] Implicit Places using invariants in 5040 ms returned []
[2025-06-03 13:45:07] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:45:08] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:45:38] [INFO ] Performed 1181/1984 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:46:08] [INFO ] Performed 1491/1984 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 13:46:22] [INFO ] Implicit Places using invariants and state equation in 74970 ms returned []
Implicit Place search using SMT with State Equation took 80024 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2025-06-03 13:46:22] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:46:22] [INFO ] Invariant cache hit.
[2025-06-03 13:46:22] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 30839ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 30843ms
Finished structural reductions in LTL mode , in 1 iterations and 110936 ms. Remains : 1984/1984 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2) (NOT p3))), (X p0), (X (NOT (AND p0 (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 141 ms. Reduced automaton from 13 states, 49 edges and 4 AP (stutter sensitive) to 13 states, 49 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 552 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), p3, (AND p3 p2), (AND (NOT p1) p3 p2), (AND (NOT p1) (NOT p0) p2 p3), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
RANDOM walk for 40000 steps (8 resets) in 331 ms. (120 steps per ms) remains 12/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 12/12 properties
[2025-06-03 13:46:54] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:46:54] [INFO ] Invariant cache hit.
[2025-06-03 13:46:54] [INFO ] State equation strengthened by 497 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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 724/730 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/730 variables, 724/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/730 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 242/972 variables, 4/739 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/972 variables, 242/981 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/972 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1408/2380 variables, 972/1953 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2380 variables, 140/2093 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2380 variables, 0/2093 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 268/2648 variables, 56/2149 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2648 variables, 56/2205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2648 variables, 6/2211 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2648 variables, 23/2234 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2648 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 5031ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 890 transitions
Trivial Post-agglo rules discarded 890 transitions
Performed 890 trivial Post agglomeration. Transition count delta: 890
Iterating post reduction 0 with 890 rules applied. Total rules applied 890 place count 1984 transition count 2206
Reduce places removed 890 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 892 rules applied. Total rules applied 1782 place count 1094 transition count 2204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1784 place count 1092 transition count 2204
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1784 place count 1092 transition count 1757
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2678 place count 645 transition count 1757
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2790 place count 589 transition count 1701
Applied a total of 2790 rules in 106 ms. Remains 589 /1984 variables (removed 1395) and now considering 1701/3096 (removed 1395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 589/1984 places, 1701/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 279 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 467352 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 12
Probabilistic random walk after 467352 steps, saw 63730 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-03 13:47:02] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
// Phase 1: matrix 1365 rows 589 cols
[2025-06-03 13:47:02] [INFO ] Computed 23 invariants in 6 ms
[2025-06-03 13:47:02] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 204/210 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 67/277 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 67/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 713/990 variables, 277/563 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/990 variables, 140/703 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/990 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 272/1262 variables, 56/759 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1262 variables, 56/815 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1262 variables, 6/821 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1262 variables, 24/845 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1262 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 252/1514 variables, 4/849 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1514 variables, 252/1101 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1514 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 4/1518 variables, 4/1105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1518 variables, 4/1109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1518 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 436/1954 variables, 256/1365 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1954 variables, 333/1698 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3558 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 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, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 204/210 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:06] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 67/277 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 67/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:06] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 24 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 713/990 variables, 277/565 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/990 variables, 140/705 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 4/709 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 272/1262 variables, 56/765 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1262 variables, 56/821 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1262 variables, 6/827 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1262 variables, 24/851 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:08] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:08] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:08] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:08] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:09] [INFO ] Deduced a trap composed of 67 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-03 13:47:09] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 8 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 6/857 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1262 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 252/1514 variables, 4/861 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1514 variables, 252/1113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:10] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:10] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:11] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:11] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:11] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:11] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:12] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:12] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:12] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:12] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:13] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:13] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:13] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:13] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:13] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:14] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:14] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:14] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:14] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:15] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 30 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1514 variables, 20/1133 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:15] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:15] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:16] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:16] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:16] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:16] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:16] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:17] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:17] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:17] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:17] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:17] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:18] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:18] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:18] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:19] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:19] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:19] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:19] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:20] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 28 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1514 variables, 20/1153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:20] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:21] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:21] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:21] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:21] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:22] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:22] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:22] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:22] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:23] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:23] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:23] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:23] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:24] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:24] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:24] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:24] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:24] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:25] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:25] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 9 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1514 variables, 20/1173 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:26] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:26] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:26] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:27] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:27] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:27] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:27] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:27] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 8 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1514 variables, 8/1181 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1514 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 4/1518 variables, 4/1185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1518 variables, 4/1189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1518 variables, 8/1197 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:30] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:31] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:31] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:31] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:31] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:32] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:32] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:32] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:32] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:33] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:33] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:33] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:34] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:34] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:34] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:34] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:35] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:35] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:35] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:35] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 33 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1518 variables, 20/1217 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:38] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:38] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:38] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:39] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:40] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:40] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:40] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:40] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 23 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1518 variables, 8/1225 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1518 variables, 0/1225 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (OVERLAPS) 436/1954 variables, 256/1481 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1954 variables, 333/1814 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1954 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:47:51] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 21 ms to minimize.
SMT process timed out in 48711ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 2 properties in 3435 ms.
Support contains 6 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 21 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 589/589 places, 1701/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 478134 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 10
Probabilistic random walk after 478134 steps, saw 63731 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
[2025-06-03 13:47:58] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2025-06-03 13:47:58] [INFO ] Invariant cache hit.
[2025-06-03 13:47:58] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 204/210 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 67/277 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 67/286 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 713/990 variables, 277/563 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/990 variables, 140/703 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/990 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 272/1262 variables, 56/759 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1262 variables, 56/815 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1262 variables, 6/821 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1262 variables, 24/845 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1262 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 252/1514 variables, 4/849 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1514 variables, 252/1101 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1514 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 4/1518 variables, 4/1105 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1518 variables, 4/1109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1518 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 436/1954 variables, 256/1365 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1954 variables, 333/1698 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2479 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 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, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 204/210 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:00] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:00] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 67/277 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 67/288 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:01] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:01] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 713/990 variables, 277/567 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/990 variables, 140/707 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 3/710 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 272/1262 variables, 56/766 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1262 variables, 56/822 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1262 variables, 6/828 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1262 variables, 24/852 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:03] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:03] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:03] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:03] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:03] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:03] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:04] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:04] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 17 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 8/860 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1262 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 252/1514 variables, 4/864 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1514 variables, 252/1116 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:05] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:05] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:06] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:06] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:06] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:06] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:06] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:07] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:07] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:07] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:07] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:08] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:08] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:08] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:08] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:08] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:09] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:09] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:09] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:09] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 22 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1514 variables, 20/1136 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:10] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:10] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:10] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:11] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:11] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:11] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:11] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:11] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:11] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:12] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:12] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:12] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:12] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:12] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:13] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:13] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:13] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:13] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:14] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:14] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 30 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1514 variables, 20/1156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:14] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:15] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:15] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:15] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:15] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:15] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:16] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:16] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:16] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:16] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:16] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:16] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:17] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:17] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:17] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:17] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:17] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:18] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 18 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1514 variables, 18/1174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:19] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 27 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1514 variables, 1/1175 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1514 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 4/1518 variables, 4/1179 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1518 variables, 4/1183 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1518 variables, 7/1190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:21] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:21] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:22] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:22] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:22] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:22] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:23] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:23] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:23] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:23] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:24] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:24] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:24] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:24] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:25] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:25] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:25] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:25] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:26] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:26] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 29 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1518 variables, 20/1210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:27] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:27] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:28] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:28] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:28] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:28] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:29] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:29] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:29] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:29] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:30] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:30] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:30] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:30] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:31] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:31] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:31] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:31] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:32] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:32] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 30 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1518 variables, 20/1230 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:33] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:34] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:34] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:34] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:35] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:35] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:36] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:36] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:36] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:36] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:37] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:37] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:37] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:37] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:38] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:38] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:38] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:38] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:39] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:39] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 23 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1518 variables, 20/1250 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:40] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:40] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:41] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:41] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:41] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:42] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:42] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:42] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 20 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1518 variables, 8/1258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:44] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:48:45] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 23 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1518 variables, 2/1260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1518 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (OVERLAPS) 436/1954 variables, 256/1516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1954 variables, 333/1849 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1954 variables, 0/1849 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (OVERLAPS) 0/1954 variables, 0/1849 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1954/1954 variables, and 1849 constraints, problems are : Problem set: 0 solved, 10 unsolved in 55050 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 141/141 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57548ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 4837 ms.
Support contains 6 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 22 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 589/589 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 21 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2025-06-03 13:49:00] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2025-06-03 13:49:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:49:01] [INFO ] Implicit Places using invariants in 779 ms returned []
[2025-06-03 13:49:01] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2025-06-03 13:49:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:49:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:49:06] [INFO ] Implicit Places using invariants and state equation in 5085 ms returned []
Implicit Place search using SMT with State Equation took 5896 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:49:06] [INFO ] Redundant transitions in 23 ms returned []
Running 1693 sub problems to find dead transitions.
[2025-06-03 13:49:06] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2025-06-03 13:49:06] [INFO ] Invariant cache hit.
[2025-06-03 13:49:06] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:22] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:22] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:22] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:23] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:23] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:23] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:23] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:24] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:24] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:24] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:24] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:25] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:25] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:25] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:25] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:26] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:26] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:26] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:26] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:27] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:28] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:28] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:29] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:29] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:29] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:30] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:30] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:30] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:30] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:31] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:31] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:31] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:31] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:32] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:32] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:32] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:32] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:33] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:33] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:33] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 22 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 20/652 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/1954 variables, and 652 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30025 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/589 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1693/1693 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 40/652 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:41] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:41] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:41] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:41] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:42] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:42] [INFO ] Deduced a trap composed of 61 places in 255 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:42] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:42] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:42] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:43] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:43] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:43] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:43] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:44] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:44] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:44] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:44] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:44] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:45] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:45] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 20/672 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:48] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:48] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:49] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:49] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:49] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:49] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:50] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:50] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:50] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:50] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:51] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:51] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:51] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:51] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:51] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:52] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:52] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:52] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:52] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:53] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 20/692 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:56] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:57] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:57] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:57] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:57] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:57] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:58] [INFO ] Deduced a trap composed of 60 places in 197 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:58] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:58] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:58] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:58] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:59] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:59] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:59] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:59] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:59] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:00] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:00] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:00] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:00] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 20/712 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:05] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:06] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:06] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:06] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:06] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:06] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/1954 variables, and 718 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30027 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/589 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1693 constraints, Known Traps: 106/106 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66389 ms. Remains : 589/589 places, 1701/1701 transitions.
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2) (NOT p3))), (X p0), (X (NOT (AND p0 (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT p1)), (F (NOT (OR (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p3) p1))), (F (NOT (AND (NOT p2) (NOT p3) p1))), (F p3), (F (NOT (OR p3 p1))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3))))]
Knowledge based reduction with 18 factoid took 464 ms. Reduced automaton from 13 states, 49 edges and 4 AP (stutter sensitive) to 13 states, 49 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 459 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), p3, (AND p3 p2), (AND (NOT p1) p3 p2), (AND (NOT p1) (NOT p0) p2 p3), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 422 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), p3, (AND p3 p2), (AND (NOT p1) p3 p2), (AND (NOT p1) (NOT p0) p2 p3), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 438 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), p3, (AND p3 p2), (AND (NOT p1) p3 p2), (AND (NOT p1) (NOT p0) p2 p3), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Product exploration explored 100000 steps with 0 reset in 326 ms.
Product exploration explored 100000 steps with 0 reset in 366 ms.
Applying partial POR strategy [true, false, true, false, true, true, false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 428 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), p3, (AND p3 p2), (AND (NOT p1) p3 p2), (AND (NOT p1) (NOT p0) p2 p3), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 6 out of 1984 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 503 rules applied. Total rules applied 503 place count 1984 transition count 3096
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 398 Pre rules applied. Total rules applied 503 place count 1984 transition count 3388
Deduced a syphon composed of 901 places in 2 ms
Iterating global reduction 1 with 398 rules applied. Total rules applied 901 place count 1984 transition count 3388
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 1101 place count 1784 transition count 3188
Deduced a syphon composed of 701 places in 1 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1301 place count 1784 transition count 3188
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1195 places in 2 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1795 place count 1784 transition count 3188
Discarding 446 places :
Symmetric choice reduction at 1 with 446 rule applications. Total rules 2241 place count 1338 transition count 2742
Deduced a syphon composed of 749 places in 1 ms
Iterating global reduction 1 with 446 rules applied. Total rules applied 2687 place count 1338 transition count 2742
Deduced a syphon composed of 749 places in 1 ms
Applied a total of 2687 rules in 469 ms. Remains 1338 /1984 variables (removed 646) and now considering 2742/3096 (removed 354) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:50:10] [INFO ] Redundant transitions in 80 ms returned []
Running 2734 sub problems to find dead transitions.
[2025-06-03 13:50:10] [INFO ] Flow matrix only has 2406 transitions (discarded 336 similar events)
// Phase 1: matrix 2406 rows 1338 cols
[2025-06-03 13:50:10] [INFO ] Computed 23 invariants in 8 ms
[2025-06-03 13:50:10] [INFO ] State equation strengthened by 789 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1338 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1338/3744 variables, and 23 constraints, problems are : Problem set: 0 solved, 2734 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1338 constraints, ReadFeed: 0/789 constraints, PredecessorRefiner: 2734/2734 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2734 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1338 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2734 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:44] [INFO ] Deduced a trap composed of 11 places in 545 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:45] [INFO ] Deduced a trap composed of 11 places in 551 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:46] [INFO ] Deduced a trap composed of 11 places in 534 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:46] [INFO ] Deduced a trap composed of 20 places in 520 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:47] [INFO ] Deduced a trap composed of 20 places in 550 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:47] [INFO ] Deduced a trap composed of 21 places in 530 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:48] [INFO ] Deduced a trap composed of 22 places in 499 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:48] [INFO ] Deduced a trap composed of 23 places in 473 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:49] [INFO ] Deduced a trap composed of 24 places in 500 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:49] [INFO ] Deduced a trap composed of 25 places in 521 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:50] [INFO ] Deduced a trap composed of 25 places in 493 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:50] [INFO ] Deduced a trap composed of 26 places in 474 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:51] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:51] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:52] [INFO ] Deduced a trap composed of 29 places in 502 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:52] [INFO ] Deduced a trap composed of 29 places in 477 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:53] [INFO ] Deduced a trap composed of 29 places in 483 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:53] [INFO ] Deduced a trap composed of 31 places in 486 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:54] [INFO ] Deduced a trap composed of 38 places in 542 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:54] [INFO ] Deduced a trap composed of 38 places in 471 ms of which 40 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1338 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2734 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:57] [INFO ] Deduced a trap composed of 11 places in 497 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:58] [INFO ] Deduced a trap composed of 11 places in 540 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:58] [INFO ] Deduced a trap composed of 11 places in 506 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:59] [INFO ] Deduced a trap composed of 11 places in 504 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:59] [INFO ] Deduced a trap composed of 11 places in 519 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:00] [INFO ] Deduced a trap composed of 12 places in 506 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:00] [INFO ] Deduced a trap composed of 13 places in 507 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:01] [INFO ] Deduced a trap composed of 14 places in 478 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:01] [INFO ] Deduced a trap composed of 15 places in 492 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:02] [INFO ] Deduced a trap composed of 16 places in 505 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:02] [INFO ] Deduced a trap composed of 17 places in 518 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:03] [INFO ] Deduced a trap composed of 20 places in 509 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:03] [INFO ] Deduced a trap composed of 20 places in 533 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:04] [INFO ] Deduced a trap composed of 20 places in 550 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:04] [INFO ] Deduced a trap composed of 20 places in 530 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:05] [INFO ] Deduced a trap composed of 20 places in 528 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:06] [INFO ] Deduced a trap composed of 56 places in 556 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:06] [INFO ] Deduced a trap composed of 56 places in 543 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:07] [INFO ] Deduced a trap composed of 56 places in 576 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:07] [INFO ] Deduced a trap composed of 65 places in 540 ms of which 81 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1338 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2734 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:09] [INFO ] Deduced a trap composed of 29 places in 496 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:10] [INFO ] Deduced a trap composed of 29 places in 464 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:10] [INFO ] Deduced a trap composed of 31 places in 465 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:11] [INFO ] Deduced a trap composed of 50 places in 329 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:11] [INFO ] Deduced a trap composed of 47 places in 356 ms of which 46 ms to minimize.
SMT process timed out in 61061ms, After SMT, problems are : Problem set: 0 solved, 2734 unsolved
Search for dead transitions found 0 dead transitions in 61066ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1338/1984 places, 2742/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61649 ms. Remains : 1338/1984 places, 2742/3096 transitions.
Built C files in :
/tmp/ltsmin10929219531169551538
[2025-06-03 13:51:11] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10929219531169551538
Running compilation step : cd /tmp/ltsmin10929219531169551538;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10929219531169551538;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10929219531169551538;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 74 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:51:14] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2025-06-03 13:51:14] [INFO ] Computed 23 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:51:19] [INFO ] Implicit Places using invariants in 5079 ms returned []
[2025-06-03 13:51:19] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:51:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 13:51:51] [INFO ] Performed 1183/1984 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:52:21] [INFO ] Performed 1491/1984 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 13:52:34] [INFO ] Implicit Places using invariants and state equation in 75083 ms returned []
Implicit Place search using SMT with State Equation took 80177 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2025-06-03 13:52:35] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:52:35] [INFO ] Invariant cache hit.
[2025-06-03 13:52:35] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 30858ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 30863ms
Finished structural reductions in LTL mode , in 1 iterations and 111120 ms. Remains : 1984/1984 places, 3096/3096 transitions.
Built C files in :
/tmp/ltsmin11202944194831245557
[2025-06-03 13:53:05] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11202944194831245557
Running compilation step : cd /tmp/ltsmin11202944194831245557;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11202944194831245557;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11202944194831245557;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 13:53:09] [INFO ] Flatten gal took : 52 ms
[2025-06-03 13:53:09] [INFO ] Flatten gal took : 53 ms
[2025-06-03 13:53:09] [INFO ] Time to serialize gal into /tmp/LTL4953103433505076614.gal : 8 ms
[2025-06-03 13:53:09] [INFO ] Time to serialize properties into /tmp/LTL11954196297666687302.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4953103433505076614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1316432885193260890.hoa' '-atoms' '/tmp/LTL11954196297666687302.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11954196297666687302.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1316432885193260890.hoa
Detected timeout of ITS tools.
[2025-06-03 13:53:24] [INFO ] Flatten gal took : 58 ms
[2025-06-03 13:53:24] [INFO ] Flatten gal took : 55 ms
[2025-06-03 13:53:24] [INFO ] Time to serialize gal into /tmp/LTL8853469904412421919.gal : 9 ms
[2025-06-03 13:53:24] [INFO ] Time to serialize properties into /tmp/LTL10065919000422684484.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8853469904412421919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10065919000422684484.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(BeginLoop_2_6_6==0)")U((G(("(BeginLoop_2_6_6==0)")||(G("(TestIdentity_3_1_3==0)"))))||(((!("((WantSection_6_T==1)&&(TestAlone_...392
Formula 0 simplified : X(!"(BeginLoop_2_6_6==0)" R (F(!"(BeginLoop_2_6_6==0)" & F!"(TestIdentity_3_1_3==0)") & ((!"(BeginLoop_2_6_6==0)" & F!"(TestIdentity...261
Detected timeout of ITS tools.
[2025-06-03 13:53:39] [INFO ] Flatten gal took : 54 ms
[2025-06-03 13:53:39] [INFO ] Applying decomposition
[2025-06-03 13:53:39] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8290063260693499193.txt' '-o' '/tmp/graph8290063260693499193.bin' '-w' '/tmp/graph8290063260693499193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8290063260693499193.bin' '-l' '-1' '-v' '-w' '/tmp/graph8290063260693499193.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:53:39] [INFO ] Decomposing Gal with order
[2025-06-03 13:53:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:53:39] [INFO ] Removed a total of 2840 redundant transitions.
[2025-06-03 13:53:39] [INFO ] Flatten gal took : 98 ms
[2025-06-03 13:53:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2025-06-03 13:53:40] [INFO ] Time to serialize gal into /tmp/LTL10548075418108836761.gal : 20 ms
[2025-06-03 13:53:40] [INFO ] Time to serialize properties into /tmp/LTL16692314978200948253.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10548075418108836761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16692314978200948253.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(("(i39.u163.BeginLoop_2_6_6==0)")U((G(("(i39.u163.BeginLoop_2_6_6==0)")||(G("(i11.u290.TestIdentity_3_1_3==0)"))))||(((!("((i15.u...509
Formula 0 simplified : X(!"(i39.u163.BeginLoop_2_6_6==0)" R (F(!"(i39.u163.BeginLoop_2_6_6==0)" & F!"(i11.u290.TestIdentity_3_1_3==0)") & ((!"(i39.u163.Beg...342
Detected timeout of ITS tools.
Treatment of property Peterson-PT-7-LTLFireability-10 finished in 751512 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((p0 U X(p1)))&&(F(!p2) U p3)))'
Support contains 8 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 65 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:53:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-03 13:53:55] [INFO ] Computed 31 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:00] [INFO ] Implicit Places using invariants in 5681 ms returned [1976, 1977, 1978, 1979, 1989, 1990, 1991]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 5695 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1985/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 65 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5827 ms. Remains : 1985/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p3) (NOT p1)), (NOT p1), p2, (NOT p3), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-11 finished in 6057 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((F(p0)&&F(p1)&&(p2||X(p2)))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 117 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
[2025-06-03 13:54:01] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 592 cols
[2025-06-03 13:54:01] [INFO ] Computed 31 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:02] [INFO ] Implicit Places using invariants in 884 ms returned [576, 577, 578, 579, 580, 589, 590, 591]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 905 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/1992 places, 1696/3096 transitions.
Applied a total of 0 rules in 23 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1045 ms. Remains : 584/1992 places, 1696/3096 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-12
Product exploration explored 100000 steps with 577 reset in 258 ms.
Stack based approach found an accepted trace after 111 steps with 4 reset with depth 21 and stack size 21 in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-12 finished in 1464 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((p0 U p1)))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 67 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:54:02] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-03 13:54:02] [INFO ] Computed 31 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:08] [INFO ] Implicit Places using invariants in 5765 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 5781 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 64 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5913 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-13 finished in 6006 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((p0 U (p1&&G(p2)))) U (p1 U !p2))))'
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 70 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 13:54:08] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 13:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:14] [INFO ] Implicit Places using invariants in 5544 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 5563 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 67 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5701 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 259 ms :[p2, p2, (OR (NOT p2) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, (NOT p2), (NOT p2), false, false]
Running random walk in product with property : Peterson-PT-7-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 604 ms.
Product exploration explored 100000 steps with 50000 reset in 664 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 25 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-7-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-7-LTLFireability-15 finished in 7283 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((p0||G((X(X((X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))||p1))))))'
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)))'
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(p0))||G(p1))))'
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((p0 U (G((p0||G(p1)))||((p0||G(p1))&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))))))'
[2025-06-03 13:54:16] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9825436391375655137
[2025-06-03 13:54:16] [INFO ] Too many transitions (3096) to apply POR reductions. Disabling POR matrices.
[2025-06-03 13:54:16] [INFO ] Applying decomposition
[2025-06-03 13:54:16] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9825436391375655137
Running compilation step : cd /tmp/ltsmin9825436391375655137;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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'
[2025-06-03 13:54:16] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6390468932776538066.txt' '-o' '/tmp/graph6390468932776538066.bin' '-w' '/tmp/graph6390468932776538066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6390468932776538066.bin' '-l' '-1' '-v' '-w' '/tmp/graph6390468932776538066.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:54:16] [INFO ] Decomposing Gal with order
[2025-06-03 13:54:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:54:17] [INFO ] Removed a total of 2837 redundant transitions.
[2025-06-03 13:54:17] [INFO ] Flatten gal took : 218 ms
[2025-06-03 13:54:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-03 13:54:17] [INFO ] Time to serialize gal into /tmp/LTLFireability5307657722249176580.gal : 34 ms
[2025-06-03 13:54:17] [INFO ] Time to serialize properties into /tmp/LTLFireability4864102258677622115.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5307657722249176580.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4864102258677622115.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((X(X(("((((((((i23.u530.TestTurn_1_1==0)||(i23.u530.Turn_1_1==0))&&((i41.u189.TestTurn_6_3==0)||(i41.u189.Turn_3_6==0)))&&(((i24.u16...7708
Formula 0 simplified : XX(!"((((((((i23.u530.TestTurn_1_1==0)||(i23.u530.Turn_1_1==0))&&((i41.u189.TestTurn_6_3==0)||(i41.u189.Turn_3_6==0)))&&(((i24.u161....7673
Compilation finished in 8139 ms.
Running link step : cd /tmp/ltsmin9825436391375655137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin9825436391375655137;'/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' '--ltl' 'X(X(((LTLAPp0==true)||[]((X(X((X(!(LTLAPp2==true)) U ((!(LTLAPp3==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))||(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9825436391375655137;'/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' '--ltl' 'X(X(((LTLAPp0==true)||[]((X(X((X(!(LTLAPp2==true)) U ((!(LTLAPp3==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))||(LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9825436391375655137;'/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' '--ltl' '<>([](!(LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9825436391375655137;'/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' '--ltl' '<>([](!(LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9825436391375655137;'/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' '--ltl' '<>(([](<>((LTLAPp5==true)))||[]((LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9825436391375655137;'/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' '--ltl' '<>(([](<>((LTLAPp5==true)))||[]((LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9825436391375655137;'/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' '--ltl' 'X(((LTLAPp7==true) U ([](((LTLAPp7==true)||[]((LTLAPp8==true))))||(((LTLAPp7==true)||[]((LTLAPp8==true)))&&(!(LTLAPp9==true) U ([](!(LTLAPp9==true))||(!(LTLAPp9==true)&&[](!(LTLAPp10==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9825436391375655137;'/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' '--ltl' 'X(((LTLAPp7==true) U ([](((LTLAPp7==true)||[]((LTLAPp8==true))))||(((LTLAPp7==true)||[]((LTLAPp8==true)))&&(!(LTLAPp9==true) U ([](!(LTLAPp9==true))||(!(LTLAPp9==true)&&[](!(LTLAPp10==true)))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9825436391375655137;'/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' '--ltl' 'X(X(((LTLAPp0==true)||[]((X(X((X(!(LTLAPp2==true)) U ((!(LTLAPp3==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))||(LTLAPp1==true))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Peterson-PT-7"
export BK_EXAMINATION="LTLFireability"
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 Peterson-PT-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876813000636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;