About the Execution of ITS-Tools for Dekker-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 852336.00 | 0.00 | 0.00 | FFFFFFFFTFFTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063700203.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 Dekker-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063700203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.9M 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 Dekker-PT-100-LTLCardinality-00
FORMULA_NAME Dekker-PT-100-LTLCardinality-01
FORMULA_NAME Dekker-PT-100-LTLCardinality-02
FORMULA_NAME Dekker-PT-100-LTLCardinality-03
FORMULA_NAME Dekker-PT-100-LTLCardinality-04
FORMULA_NAME Dekker-PT-100-LTLCardinality-05
FORMULA_NAME Dekker-PT-100-LTLCardinality-06
FORMULA_NAME Dekker-PT-100-LTLCardinality-07
FORMULA_NAME Dekker-PT-100-LTLCardinality-08
FORMULA_NAME Dekker-PT-100-LTLCardinality-09
FORMULA_NAME Dekker-PT-100-LTLCardinality-10
FORMULA_NAME Dekker-PT-100-LTLCardinality-11
FORMULA_NAME Dekker-PT-100-LTLCardinality-12
FORMULA_NAME Dekker-PT-100-LTLCardinality-13
FORMULA_NAME Dekker-PT-100-LTLCardinality-14
FORMULA_NAME Dekker-PT-100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748644077615
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 22:27:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 22:28:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 22:28:01] [INFO ] Load time of PNML (sax parser for PT used): 1069 ms
[2025-05-30 22:28:01] [INFO ] Transformed 500 places.
[2025-05-30 22:28:01] [INFO ] Transformed 10200 transitions.
[2025-05-30 22:28:01] [INFO ] Found NUPN structural information;
[2025-05-30 22:28:01] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 1427 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-100-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 606 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:28:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2025-05-30 22:28:02] [INFO ] Computed 300 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:28:14] [INFO ] Implicit Places using invariants in 12314 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 269, 272, 275, 278, 281, 284, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 479, 485, 488, 497]
Discarding 92 places :
Implicit Place search using SMT only with invariants took 12406 ms to find 92 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 408/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 223 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13280 ms. Remains : 408/500 places, 10200/10200 transitions.
Support contains 52 out of 408 places after structural reductions.
[2025-05-30 22:28:16] [INFO ] Flatten gal took : 824 ms
[2025-05-30 22:28:17] [INFO ] Flatten gal took : 501 ms
[2025-05-30 22:28:18] [INFO ] Input system was already deterministic with 10200 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (8 resets) in 3783 ms. (10 steps per ms) remains 7/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 6/6 properties
[2025-05-30 22:28:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 408 cols
[2025-05-30 22:28:20] [INFO ] Computed 208 invariants in 8 ms
[2025-05-30 22:28:20] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp14 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 18/27 variables, 9/18 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 18/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:21] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:21] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:21] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:21] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:21] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:21] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:22] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:22] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:22] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:22] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:22] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:22] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:22] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:22] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 15/51 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/36 variables, 9/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 9/69 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:23] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:23] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:23] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:23] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:23] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:23] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:23] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:24] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:24] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:24] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 10/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/38 variables, 2/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 2/83 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/38 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 36/74 variables, 38/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/74 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 182/256 variables, 100/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 461/717 variables, 279/500 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/717 variables, 279/779 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/717 variables, 85/864 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 717/808 variables, and 864 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5020 ms.
Refiners :[Domain max(s): 317/408 constraints, Positive P Invariants (semi-flows): 103/200 constraints, Generalized P Invariants (flows): 2/8 constraints, State Equation: 317/408 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 16/24 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 16/32 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 15/47 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 8/32 variables, 8/55 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 8/63 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 5/68 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/33 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/33 variables, 1/70 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/33 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 32/65 variables, 33/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/65 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 184/249 variables, 100/203 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 467/716 variables, 283/486 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/716 variables, 283/769 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/716 variables, 85/854 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/716 variables, 5/859 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/716 variables, 5/864 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:27] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:27] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:28] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:28] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:28] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:29] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:29] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:29] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:30] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:30] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:30] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 1)
(s202 1)
(s204 1)
(s206 1)
(s208 1)
(s210 1)
(s212 0)
(s214 1)
(s216 1)
(s218 0)
(s219 1)
(s221 0)
(s223 1)
(s225 1)
(s227 1)
(s229 0)
(s231 1)
(s233 1)
(s235 1)
(s237 1)
(s239 1)
(s241 1)
(s242 0)
(s243 1)
(s245 0)
(s246 1)
(s248 0)
(s250 1)
(s252 1)
(s254 1)
(s256 1)
(s258 1)
(s260 0)
(s261 1)
(s263 1)
(s265 1)
(s267 1)
(s269 1)
(s271 1)
(s273 1)
(s275 0)
(s277 1)
(s279 1)
(s281 1)
(s283 0)
(s285 1)
(s287 1)
(s289 1)
(s291 1)
(s293 1)
(s295 1)
(s297 1)
(s299 0)
(s301 1)
(s303 1)
(s305 1)
(s307 0)
(s309 1)
(s311 1)
(s312 0)
(s313 1)
(s315 1)
(s317 1)
(s318 0)
(s319 0)
(s321 1)
(s323 1)
(s325 0)
(s326 0)
(s327 1)
(s329 0)
(s331 1)
(s333 1)
(s335 1)
(s337 0)
(s339 1)
(s341 1)
(s343 1)
(s345 0)
(s347 1)
(s349 1)
(s351 0)
(s352 1)
(s354 1)
(s356 1)
(s358 1)
(s360 1)
(s362 1)
(s364 1)
(s366 1)
(s368 1)
(s370 1)
(s372 1)
(s374 1)
(s376 1)
(s377 0)
(s378 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 716/808 variables, and 875 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5018 ms.
Refiners :[Domain max(s): 316/408 constraints, Positive P Invariants (semi-flows): 101/200 constraints, Generalized P Invariants (flows): 1/8 constraints, State Equation: 316/408 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10261ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 1143 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1146 ms. Remains : 408/408 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 2647 ms. (15 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 129583 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :1 out of 5
Probabilistic random walk after 129583 steps, saw 119976 distinct states, run finished after 3008 ms. (steps per millisecond=43 ) properties seen :1
[2025-05-30 22:28:36] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:28:36] [INFO ] Invariant cache hit.
[2025-05-30 22:28:36] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 16/24 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:36] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/32 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/33 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/33 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 32/65 variables, 33/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/65 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 184/249 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 467/716 variables, 283/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/716 variables, 283/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/716 variables, 85/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/716 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 92/808 variables, 99/943 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/808 variables, 92/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/808 variables, 7/1042 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/808 variables, 92/1134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/808 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/808 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 1134 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2401 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 408/408 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 16/24 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/32 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:38] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:38] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:38] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:38] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/33 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/33 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/33 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 32/65 variables, 33/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/65 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 184/249 variables, 100/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 467/716 variables, 283/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/716 variables, 283/763 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/716 variables, 85/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/716 variables, 4/852 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:40] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 13 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/716 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:41] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:41] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 10 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/716 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:42] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:42] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 11 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/716 variables, 2/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:43] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:43] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:43] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:44] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:44] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:45] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:45] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:45] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:45] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 9 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/716 variables, 9/866 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:46] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:46] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:47] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:47] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:48] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:48] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 11 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/716 variables, 6/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:48] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:49] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 7 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/716 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:49] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:49] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:50] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:50] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:51] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 9 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/716 variables, 5/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:51] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:51] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:51] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:52] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:52] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:52] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:53] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:53] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:53] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:53] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:54] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:54] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:54] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:54] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:55] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 7 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/716 variables, 16/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:55] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:55] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:55] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:56] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:56] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:56] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:56] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:56] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:56] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 6 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/716 variables, 9/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/716 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 92/808 variables, 99/1003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/808 variables, 92/1095 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/808 variables, 7/1102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/808 variables, 92/1194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:57] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:57] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/808 variables, 2/1196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:57] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:57] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:58] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:58] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:58] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:58] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:58] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:59] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:59] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:59] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:28:59] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 5 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/808 variables, 11/1207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:00] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:00] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:00] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:00] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:00] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:00] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:01] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:01] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:01] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:01] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:01] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:01] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:01] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:02] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:02] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:02] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:02] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:02] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:02] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:02] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/808 variables, 20/1227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:02] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:02] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:03] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:03] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:03] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/808 variables, 5/1232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:03] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:03] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:03] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:03] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:03] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:04] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:05] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:05] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:05] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/808 variables, 19/1251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/808 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 0/808 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 1251 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27565 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 408/408 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 123/123 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30016ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 5100 ms.
Support contains 4 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 621 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 408/408 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1664 ms. (24 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
[2025-05-30 22:29:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:29:12] [INFO ] Invariant cache hit.
[2025-05-30 22:29:12] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:12] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/17 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 196/213 variables, 100/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 497/710 variables, 301/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/710 variables, 301/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/710 variables, 91/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/710 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 98/808 variables, 105/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/808 variables, 98/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/808 variables, 7/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/808 variables, 98/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/808 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/808 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 1125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 994 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 408/408 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/17 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 196/213 variables, 100/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 497/710 variables, 301/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/710 variables, 301/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/710 variables, 91/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/710 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/710 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 98/808 variables, 105/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/808 variables, 98/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/808 variables, 7/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/808 variables, 98/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/808 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/808 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 1126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 958 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 408/408 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1981ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1175 ms.
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 750 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 408/408 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1283 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 273003 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 273003 steps, saw 250601 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2025-05-30 22:29:19] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:29:19] [INFO ] Invariant cache hit.
[2025-05-30 22:29:19] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:19] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/17 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 196/213 variables, 100/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 497/710 variables, 301/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/710 variables, 301/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/710 variables, 91/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/710 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 98/808 variables, 105/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/808 variables, 98/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/808 variables, 7/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/808 variables, 98/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/808 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/808 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 1125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1293 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 408/408 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/17 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 196/213 variables, 100/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 497/710 variables, 301/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/710 variables, 301/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/710 variables, 91/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/710 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/710 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 98/808 variables, 105/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/808 variables, 98/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/808 variables, 7/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/808 variables, 98/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/808 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/808 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 1126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1178 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 408/408 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2504ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1332 ms.
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 423 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 408/408 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 470 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:29:24] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:29:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:29:28] [INFO ] Implicit Places using invariants in 4037 ms returned [218, 245, 260, 351, 388, 393, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 4055 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 401/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 658 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5186 ms. Remains : 401/408 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1599 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 249874 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 249874 steps, saw 229675 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2025-05-30 22:29:32] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2025-05-30 22:29:32] [INFO ] Computed 201 invariants in 7 ms
[2025-05-30 22:29:32] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:32] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/17 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 196/213 variables, 100/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 490/703 variables, 294/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/703 variables, 294/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/703 variables, 98/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/703 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 98/801 variables, 98/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/801 variables, 98/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/801 variables, 98/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/801 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/801 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 801/801 variables, and 1104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1024 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 401/401 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/9 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/17 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 196/213 variables, 100/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 490/703 variables, 294/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/703 variables, 294/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/703 variables, 98/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/703 variables, 1/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/703 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 98/801 variables, 98/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/801 variables, 98/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/801 variables, 98/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/801 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:35] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 10 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/801 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:35] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:35] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:35] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 8 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/801 variables, 3/1109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:29:36] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 7 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/801 variables, 1/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/801 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/801 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 801/801 variables, and 1110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2764 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 401/401 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3818ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 528 ms.
Support contains 2 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 428 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 401/401 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 436 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:29:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:29:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:29:40] [INFO ] Implicit Places using invariants in 2957 ms returned []
Implicit Place search using SMT only with invariants took 2959 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2025-05-30 22:29:41] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:29:41] [INFO ] Invariant cache hit.
[2025-05-30 22:29:41] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 41343ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 41471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44940 ms. Remains : 401/401 places, 10200/10200 transitions.
FORMULA Dekker-PT-100-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Dekker-PT-100-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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' '!(((G(p0) U p1)&&((F(p3)||p2) U X((p4&&G(p5))))))'
Support contains 9 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 160 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:30:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 408 cols
[2025-05-30 22:30:23] [INFO ] Computed 208 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:30:27] [INFO ] Implicit Places using invariants in 4143 ms returned [218, 245, 260, 351, 388, 393, 400, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 4159 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 160 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4482 ms. Remains : 400/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 866 ms :[(OR (NOT p4) (NOT p1) (NOT p5)), true, (NOT p0), (NOT p1), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p3) (NOT p5))), (OR (NOT p5) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p5)), (NOT p5)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-00
Product exploration explored 100000 steps with 699 reset in 3600 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 83 in 6 ms.
FORMULA Dekker-PT-100-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-00 finished in 9124 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 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 162 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:30:32] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:30:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:30:36] [INFO ] Implicit Places using invariants in 4240 ms returned [218, 245, 260, 351, 388, 393, 400, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 4251 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 160 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4575 ms. Remains : 400/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 505 steps with 250 reset in 23 ms.
FORMULA Dekker-PT-100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-02 finished in 4758 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' '!(G(F(p0)))'
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 1610 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:30:38] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:30:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:30:42] [INFO ] Implicit Places using invariants in 3972 ms returned [218, 245, 260, 351, 388, 393, 400, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 3986 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 857 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6457 ms. Remains : 400/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-03
Product exploration explored 100000 steps with 500 reset in 3051 ms.
Stack based approach found an accepted trace after 190 steps with 1 reset with depth 60 and stack size 59 in 6 ms.
FORMULA Dekker-PT-100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-03 finished in 9615 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' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 747 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:30:47] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:30:51] [INFO ] Implicit Places using invariants in 4129 ms returned [245, 260, 351, 388, 393, 400, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 4141 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 922 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5811 ms. Remains : 401/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-04
Product exploration explored 100000 steps with 270 reset in 3196 ms.
Stack based approach found an accepted trace after 103 steps with 0 reset with depth 104 and stack size 102 in 4 ms.
FORMULA Dekker-PT-100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-04 finished in 9110 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 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 560 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:30:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:30:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:31:00] [INFO ] Implicit Places using invariants in 3731 ms returned [218, 245, 260, 351, 388, 393, 400, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 3749 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 921 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5236 ms. Remains : 400/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 3715 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 2 ms.
FORMULA Dekker-PT-100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-05 finished in 9046 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(G(p0))))'
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 111 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:31:05] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:31:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:31:09] [INFO ] Implicit Places using invariants in 4351 ms returned [218, 245, 260, 351, 388, 393, 400, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 4363 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 164 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4641 ms. Remains : 400/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-07 finished in 4856 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(F(p0))))'
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 160 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:31:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:31:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:31:13] [INFO ] Implicit Places using invariants in 3814 ms returned [218, 245, 260, 351, 388, 393, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 3829 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 184 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4175 ms. Remains : 401/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 2992 ms.
Product exploration explored 100000 steps with 33333 reset in 2613 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 25 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Dekker-PT-100-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-100-LTLCardinality-08 finished in 10242 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)||G(p1)))'
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 147 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:31:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:31:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:31:24] [INFO ] Implicit Places using invariants in 4063 ms returned [218, 245, 260, 351, 388, 393, 400, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 4074 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 162 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4384 ms. Remains : 400/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 355 steps with 13 reset in 19 ms.
FORMULA Dekker-PT-100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-09 finished in 4667 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||G((X(G(!p0))||G(p1)||(p1&&F(!p2))))) U X(p2)))'
Support contains 4 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 158 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:31:24] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:31:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:31:29] [INFO ] Implicit Places using invariants in 4147 ms returned [218, 245, 260, 351, 393, 400, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 4159 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 164 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4483 ms. Remains : 401/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 574 ms :[(NOT p2), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (NOT p2), true, p0, (AND p0 (NOT p1)), (AND p2 p0 (NOT p1)), p2, (AND p2 p0), (AND p2 (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 3150 ms.
Product exploration explored 100000 steps with 50000 reset in 2987 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 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 22 ms. Reduced automaton from 11 states, 24 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Dekker-PT-100-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-100-LTLCardinality-11 finished in 11436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F((p1||X(((p1 U !p2) U (p1&&(p1 U !p2)))))))))'
Support contains 3 out of 408 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 596 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:31:36] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:31:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:31:40] [INFO ] Implicit Places using invariants in 4129 ms returned [218, 245, 351, 388, 393, 400, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 4141 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 834 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5575 ms. Remains : 401/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-12
Product exploration explored 100000 steps with 1035 reset in 2879 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-12 finished in 8559 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&&X((p1&&F(p2))))))'
Support contains 5 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 97 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:31:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:31:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:31:48] [INFO ] Implicit Places using invariants in 3665 ms returned [260, 351, 388, 393, 400, 403]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 3675 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 161 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3935 ms. Remains : 402/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-13 finished in 4209 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(F((G((F(p1)&&p0))||X(X(F(p2)))))))'
Support contains 5 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 169 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:31:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:31:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:31:53] [INFO ] Implicit Places using invariants in 4182 ms returned [218, 245, 260, 351, 388, 393, 400]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 4194 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 163 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4529 ms. Remains : 401/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-14
Product exploration explored 100000 steps with 18820 reset in 3022 ms.
Stack based approach found an accepted trace after 101 steps with 13 reset with depth 13 and stack size 13 in 4 ms.
FORMULA Dekker-PT-100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-14 finished in 7893 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 X((p1 U (G(p2)||F(G(p1)))))))'
Support contains 5 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 100 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:31:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:31:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:32:00] [INFO ] Implicit Places using invariants in 3287 ms returned [218, 245, 260, 351, 388, 393, 400, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 3298 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 163 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3562 ms. Remains : 400/408 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 3740 ms.
Product exploration explored 100000 steps with 0 reset in 3212 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 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 811 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 2279 ms. (17 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
[2025-05-30 22:32:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2025-05-30 22:32:09] [INFO ] Computed 200 invariants in 3 ms
[2025-05-30 22:32:09] [INFO ] State equation strengthened by 100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1053 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:10] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 4/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:12] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:12] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:13] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:13] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:14] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:14] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:15] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:15] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:32:16] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 13 ms to minimize.
SMT process timed out in 6474ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 40 steps, including 9 resets, run visited all 4 properties in 4 ms. (steps per millisecond=10 )
Parikh walk visited 4 properties in 12 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p2 p1)))]
Knowledge based reduction with 10 factoid took 1521 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 169 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:32:18] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:32:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:32:21] [INFO ] Implicit Places using invariants in 2837 ms returned []
Implicit Place search using SMT only with invariants took 2838 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2025-05-30 22:32:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:32:21] [INFO ] Invariant cache hit.
[2025-05-30 22:32:21] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 41523ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 41608ms
Finished structural reductions in LTL mode , in 1 iterations and 44710 ms. Remains : 400/400 places, 10200/10200 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 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 861 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 2319 ms. (17 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
[2025-05-30 22:33:05] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:33:05] [INFO ] Invariant cache hit.
[2025-05-30 22:33:05] [INFO ] State equation strengthened by 100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 958 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:06] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 4/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:07] [INFO ] Deduced a trap composed of 4 places in 544 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:08] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:08] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:09] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:09] [INFO ] Deduced a trap composed of 4 places in 484 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:10] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:11] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/800 variables, and 824 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Domain max(s): 304/400 constraints, Positive P Invariants (semi-flows): 104/200 constraints, State Equation: 304/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5996ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 765 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 766 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1717 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
[2025-05-30 22:33:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:33:12] [INFO ] Invariant cache hit.
[2025-05-30 22:33:12] [INFO ] State equation strengthened by 100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 866 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 2/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:14] [INFO ] Deduced a trap composed of 4 places in 549 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:15] [INFO ] Deduced a trap composed of 4 places in 548 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:16] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:16] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:17] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:17] [INFO ] Deduced a trap composed of 4 places in 460 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:18] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:18] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:19] [INFO ] Deduced a trap composed of 4 places in 465 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:19] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:20] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:20] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:21] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:21] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:22] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:22] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:22] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:23] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:23] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:24] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 11 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:24] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:25] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:25] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:25] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:26] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:26] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:26] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:26] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:27] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:27] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:27] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:28] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:28] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:28] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:28] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:29] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:29] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:29] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:29] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:30] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:30] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:30] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:30] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:30] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:30] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:31] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:31] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:32] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:32] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:32] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:33] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:33] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:33] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:34] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:34] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:34] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:34] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:35] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:35] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:35] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 8 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:35] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:36] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:36] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:36] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:36] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:36] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:36] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:36] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:36] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:37] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:37] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:37] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:37] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:37] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:37] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:38] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:38] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:38] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:38] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:38] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:38] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:39] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:39] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:39] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:39] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:39] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:40] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:40] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:40] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:40] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:40] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:40] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:41] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:41] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:41] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:41] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:41] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:41] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:41] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:41] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:42] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:42] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:42] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:42] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:42] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:42] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:42] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:43] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:43] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:43] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:43] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:43] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:43] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:43] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:44] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:44] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:44] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:44] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:44] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:44] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 20/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:44] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:45] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:45] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:45] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:45] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:45] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 6/940 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/704 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 96/800 variables, 96/1036 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 96/1228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:46] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/800 variables, 1/1229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/800 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/800 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33286 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 127/127 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34180ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1832 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 411 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 2261 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 265024 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 265024 steps, saw 243318 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :0
[2025-05-30 22:33:52] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:33:52] [INFO ] Invariant cache hit.
[2025-05-30 22:33:52] [INFO ] State equation strengthened by 100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 673 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:54] [INFO ] Deduced a trap composed of 4 places in 552 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:55] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:55] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:56] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:56] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:57] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:58] [INFO ] Deduced a trap composed of 4 places in 551 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:58] [INFO ] Deduced a trap composed of 4 places in 527 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:59] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:33:59] [INFO ] Deduced a trap composed of 4 places in 505 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:00] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:00] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:01] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:01] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:02] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:02] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:03] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:03] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:04] [INFO ] Deduced a trap composed of 4 places in 484 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:04] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 14 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:05] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:05] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:05] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:06] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:06] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:07] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:07] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:08] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:08] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:09] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:09] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:09] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:10] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:10] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:11] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:11] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:11] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:12] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:12] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:12] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 9 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:13] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:13] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:13] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:13] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:14] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:14] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:14] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:14] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:15] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:15] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:15] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:15] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:16] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:16] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:16] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:16] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:17] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:17] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:17] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:17] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:17] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:17] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:18] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:18] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:18] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:18] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:19] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:19] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:19] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:19] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:19] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:20] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:20] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:20] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:20] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:20] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:21] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:21] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:21] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:21] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:21] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:22] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:22] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:22] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:22] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:22] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:22] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:23] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:23] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:23] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:23] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:23] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:23] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:24] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:24] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:24] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:24] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:24] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:25] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:25] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:25] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:25] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:25] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:26] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:26] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:26] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:26] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:26] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:26] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:26] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:27] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:27] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:27] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:27] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:27] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:27] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:28] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:28] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:28] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:28] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 20/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:28] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:28] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:28] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:29] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:29] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:29] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:29] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:29] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:29] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:30] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:30] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:30] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:30] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:30] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:34:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 17/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/704 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 96/800 variables, 96/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 96/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/800 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/800 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37802 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 137/137 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38509ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 336 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 401 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 394 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:34:32] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:34:34] [INFO ] Implicit Places using invariants in 2151 ms returned []
Implicit Place search using SMT only with invariants took 2153 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2025-05-30 22:34:34] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:34:34] [INFO ] Invariant cache hit.
[2025-05-30 22:34:34] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 40870ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 40910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43496 ms. Remains : 400/400 places, 10200/10200 transitions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p2 p1)))]
Knowledge based reduction with 10 factoid took 1232 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 3406 ms.
Product exploration explored 100000 steps with 0 reset in 3458 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 1036 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Running 10100 sub problems to find dead transitions.
[2025-05-30 22:35:25] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:35:25] [INFO ] Invariant cache hit.
[2025-05-30 22:35:25] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 40762ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 40789ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41855 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin2611626396849892911
[2025-05-30 22:36:06] [INFO ] Built C files in 294ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2611626396849892911
Running compilation step : cd /tmp/ltsmin2611626396849892911;'/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/ltsmin2611626396849892911;'/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/ltsmin2611626396849892911;'/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 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 97 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:36:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:36:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:36:12] [INFO ] Implicit Places using invariants in 2740 ms returned []
Implicit Place search using SMT only with invariants took 2746 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2025-05-30 22:36:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:36:12] [INFO ] Invariant cache hit.
[2025-05-30 22:36:12] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 41298ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 41339ms
Finished structural reductions in LTL mode , in 1 iterations and 44216 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin378003475175769334
[2025-05-30 22:36:54] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin378003475175769334
Running compilation step : cd /tmp/ltsmin378003475175769334;'/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/ltsmin378003475175769334;'/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/ltsmin378003475175769334;'/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-05-30 22:36:58] [INFO ] Flatten gal took : 404 ms
[2025-05-30 22:36:58] [INFO ] Flatten gal took : 398 ms
[2025-05-30 22:36:58] [INFO ] Time to serialize gal into /tmp/LTL5728029605778848712.gal : 139 ms
[2025-05-30 22:36:58] [INFO ] Time to serialize properties into /tmp/LTL15966699389070007352.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/LTL5728029605778848712.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12135499603580887609.hoa' '-atoms' '/tmp/LTL15966699389070007352.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...319
Loading property file /tmp/LTL15966699389070007352.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12135499603580887609.hoa
Detected timeout of ITS tools.
[2025-05-30 22:37:14] [INFO ] Flatten gal took : 575 ms
[2025-05-30 22:37:15] [INFO ] Flatten gal took : 480 ms
[2025-05-30 22:37:15] [INFO ] Time to serialize gal into /tmp/LTL15813590515871975998.gal : 47 ms
[2025-05-30 22:37:15] [INFO ] Time to serialize properties into /tmp/LTL14674142038953571553.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/LTL15813590515871975998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14674142038953571553.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...277
Read 1 LTL properties
Checking formula 0 : !((("(flag_0_57==1)")U(X(("((flag_1_99==0)||(flag_0_40==1))")U((G("((p3_86==0)||(p3_99==1))"))||(F(G("((flag_1_99==0)||(flag_0_40==1))...164
Formula 0 simplified : !"(flag_0_57==1)" R X(!"((flag_1_99==0)||(flag_0_40==1))" R (F!"((p3_86==0)||(p3_99==1))" & GF!"((flag_1_99==0)||(flag_0_40==1))"))
Detected timeout of ITS tools.
[2025-05-30 22:37:30] [INFO ] Flatten gal took : 364 ms
[2025-05-30 22:37:30] [INFO ] Applying decomposition
[2025-05-30 22:37:30] [INFO ] Flatten gal took : 374 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/graph638251711475035671.txt' '-o' '/tmp/graph638251711475035671.bin' '-w' '/tmp/graph638251711475035671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph638251711475035671.bin' '-l' '-1' '-v' '-w' '/tmp/graph638251711475035671.weights' '-q' '0' '-e' '0.001'
[2025-05-30 22:37:31] [INFO ] Decomposing Gal with order
[2025-05-30 22:37:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 22:37:33] [INFO ] Removed a total of 29400 redundant transitions.
[2025-05-30 22:37:33] [INFO ] Flatten gal took : 971 ms
[2025-05-30 22:37:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 397 ms.
[2025-05-30 22:37:33] [INFO ] Time to serialize gal into /tmp/LTL11206631384917989069.gal : 66 ms
[2025-05-30 22:37:33] [INFO ] Time to serialize properties into /tmp/LTL4223590724920276462.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/LTL11206631384917989069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4223590724920276462.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 : !((("(u57.flag_0_57==1)")U(X(("((u99.flag_1_99==0)||(u40.flag_0_40==1))")U((G("((u86.p3_86==0)||(u99.p3_99==1))"))||(F(G("((u99.flag_1...192
Formula 0 simplified : !"(u57.flag_0_57==1)" R X(!"((u99.flag_1_99==0)||(u40.flag_0_40==1))" R (F!"((u86.p3_86==0)||(u99.p3_99==1))" & GF!"((u99.flag_1_99=...182
Detected timeout of ITS tools.
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 352082 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 X((p1 U (G(p2)||F(G(p1)))))))'
Found a Lengthening insensitive property : Dekker-PT-100-LTLCardinality-15
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 408 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 484 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:37:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 408 cols
[2025-05-30 22:37:49] [INFO ] Computed 208 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:37:53] [INFO ] Implicit Places using invariants in 4101 ms returned [218, 245, 260, 351, 388, 393, 400, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 4115 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 400/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 449 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5048 ms. Remains : 400/408 places, 10200/10200 transitions.
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 3001 ms.
Product exploration explored 100000 steps with 0 reset in 3330 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 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 909 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 2236 ms. (17 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
[2025-05-30 22:38:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2025-05-30 22:38:02] [INFO ] Computed 200 invariants in 2 ms
[2025-05-30 22:38:02] [INFO ] State equation strengthened by 100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 965 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:03] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 4/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:05] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:06] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:06] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:07] [INFO ] Deduced a trap composed of 4 places in 479 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:07] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:08] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:08] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:09] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 14 ms to minimize.
SMT process timed out in 6264ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 16 steps, including 3 resets, run visited all 4 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 4 properties in 3 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p2 p1)))]
Knowledge based reduction with 10 factoid took 1174 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 180 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:38:10] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:38:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:38:12] [INFO ] Implicit Places using invariants in 2039 ms returned []
Implicit Place search using SMT only with invariants took 2040 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2025-05-30 22:38:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:38:12] [INFO ] Invariant cache hit.
[2025-05-30 22:38:12] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 40727ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 40748ms
Finished structural reductions in LTL mode , in 1 iterations and 42992 ms. Remains : 400/400 places, 10200/10200 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 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 856 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 2031 ms. (19 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
[2025-05-30 22:38:55] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:38:55] [INFO ] Invariant cache hit.
[2025-05-30 22:38:56] [INFO ] State equation strengthened by 100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 674 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 2/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:57] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:58] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:58] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:58] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:59] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:59] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:38:59] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:39:00] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:39:00] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:39:00] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:39:01] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:39:01] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:39:01] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 8 ms to minimize.
SMT process timed out in 5872ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p2 p1)))]
Knowledge based reduction with 10 factoid took 1446 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 3129 ms.
Product exploration explored 100000 steps with 0 reset in 3078 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 538 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Running 10100 sub problems to find dead transitions.
[2025-05-30 22:39:10] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:39:10] [INFO ] Invariant cache hit.
[2025-05-30 22:39:10] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 40358ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 40378ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40927 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin5626979434333413138
[2025-05-30 22:39:51] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5626979434333413138
Running compilation step : cd /tmp/ltsmin5626979434333413138;'/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/ltsmin5626979434333413138;'/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/ltsmin5626979434333413138;'/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 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 98 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2025-05-30 22:39:54] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:39:56] [INFO ] Implicit Places using invariants in 2285 ms returned []
Implicit Place search using SMT only with invariants took 2286 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2025-05-30 22:39:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 22:39:56] [INFO ] Invariant cache hit.
[2025-05-30 22:39:56] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 41044ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 41065ms
Finished structural reductions in LTL mode , in 1 iterations and 43460 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin1917565121930798984
[2025-05-30 22:40:38] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1917565121930798984
Running compilation step : cd /tmp/ltsmin1917565121930798984;'/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/ltsmin1917565121930798984;'/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/ltsmin1917565121930798984;'/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-05-30 22:40:42] [INFO ] Flatten gal took : 595 ms
[2025-05-30 22:40:42] [INFO ] Flatten gal took : 593 ms
[2025-05-30 22:40:42] [INFO ] Time to serialize gal into /tmp/LTL5075051850053565419.gal : 61 ms
[2025-05-30 22:40:42] [INFO ] Time to serialize properties into /tmp/LTL9025313037282871890.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/LTL5075051850053565419.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14632976757677833502.hoa' '-atoms' '/tmp/LTL9025313037282871890.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/LTL9025313037282871890.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14632976757677833502.hoa
Detected timeout of ITS tools.
[2025-05-30 22:40:58] [INFO ] Flatten gal took : 410 ms
[2025-05-30 22:40:58] [INFO ] Flatten gal took : 515 ms
[2025-05-30 22:40:58] [INFO ] Time to serialize gal into /tmp/LTL17759184018492347013.gal : 60 ms
[2025-05-30 22:40:58] [INFO ] Time to serialize properties into /tmp/LTL8263046580648236444.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/LTL17759184018492347013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8263046580648236444.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 : !((("(flag_0_57==1)")U(X(("((flag_1_99==0)||(flag_0_40==1))")U((G("((p3_86==0)||(p3_99==1))"))||(F(G("((flag_1_99==0)||(flag_0_40==1))...164
Formula 0 simplified : !"(flag_0_57==1)" R X(!"((flag_1_99==0)||(flag_0_40==1))" R (F!"((p3_86==0)||(p3_99==1))" & GF!"((flag_1_99==0)||(flag_0_40==1))"))
Detected timeout of ITS tools.
[2025-05-30 22:41:14] [INFO ] Flatten gal took : 407 ms
[2025-05-30 22:41:14] [INFO ] Applying decomposition
[2025-05-30 22:41:14] [INFO ] Flatten gal took : 389 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/graph17751111482051281479.txt' '-o' '/tmp/graph17751111482051281479.bin' '-w' '/tmp/graph17751111482051281479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17751111482051281479.bin' '-l' '-1' '-v' '-w' '/tmp/graph17751111482051281479.weights' '-q' '0' '-e' '0.001'
[2025-05-30 22:41:15] [INFO ] Decomposing Gal with order
[2025-05-30 22:41:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 22:41:16] [INFO ] Removed a total of 29400 redundant transitions.
[2025-05-30 22:41:16] [INFO ] Flatten gal took : 579 ms
[2025-05-30 22:41:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 193 ms.
[2025-05-30 22:41:16] [INFO ] Time to serialize gal into /tmp/LTL2348235011882064689.gal : 28 ms
[2025-05-30 22:41:16] [INFO ] Time to serialize properties into /tmp/LTL8342341362458620632.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/LTL2348235011882064689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8342341362458620632.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 : !((("(u57.flag_0_57==1)")U(X(("((u99.flag_1_99==0)||(u40.flag_0_40==1))")U((G("((u86.p3_86==0)||(u99.p3_99==1))"))||(F(G("((u99.flag_1...192
Formula 0 simplified : !"(u57.flag_0_57==1)" R X(!"((u99.flag_1_99==0)||(u40.flag_0_40==1))" R (F!"((u86.p3_86==0)||(u99.p3_99==1))" & GF!"((u99.flag_1_99=...182
Detected timeout of ITS tools.
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 223083 ms.
[2025-05-30 22:41:32] [INFO ] Flatten gal took : 584 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3181504332775468946
[2025-05-30 22:41:32] [INFO ] Too many transitions (10200) to apply POR reductions. Disabling POR matrices.
[2025-05-30 22:41:32] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3181504332775468946
Running compilation step : cd /tmp/ltsmin3181504332775468946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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-05-30 22:41:33] [INFO ] Applying decomposition
[2025-05-30 22:41:33] [INFO ] Flatten gal took : 410 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/graph6674962487538630123.txt' '-o' '/tmp/graph6674962487538630123.bin' '-w' '/tmp/graph6674962487538630123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6674962487538630123.bin' '-l' '-1' '-v' '-w' '/tmp/graph6674962487538630123.weights' '-q' '0' '-e' '0.001'
[2025-05-30 22:41:33] [INFO ] Decomposing Gal with order
[2025-05-30 22:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 22:41:34] [INFO ] Removed a total of 29697 redundant transitions.
[2025-05-30 22:41:34] [INFO ] Flatten gal took : 579 ms
[2025-05-30 22:41:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 431 ms.
[2025-05-30 22:41:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality11415028614180957964.gal : 37 ms
[2025-05-30 22:41:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality7933880604913356720.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/LTLCardinality11415028614180957964.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7933880604913356720.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...277
Read 1 LTL properties
Checking formula 0 : !((("(u56.flag_0_57==1)")U(X(("((u96.flag_1_99==0)||(u39.flag_0_40==1))")U((G("((u85.p3_86==0)||(u96.p3_99==1))"))||(F(G("((u96.flag_1...192
Formula 0 simplified : !"(u56.flag_0_57==1)" R X(!"((u96.flag_1_99==0)||(u39.flag_0_40==1))" R (F!"((u85.p3_86==0)||(u96.p3_99==1))" & GF!"((u96.flag_1_99=...182
Reverse transition relation is NOT exact ! Due to transitions u0.t101, u1.t203, u2.t305, u3.t407, u4.t509, u5.t611, u6.t713, u7.t815, u8.t917, u9.t1121, u1...1252
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2956 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,31.2336,568756,1,0,1.46217e+06,5194,72358,941145,314,5298,1924145
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-100-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 849869 ms.
BK_STOP 1748644929951
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Dekker-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854063700203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-100.tgz
mv Dekker-PT-100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;