About the Execution of ITS-Tools for DES-PT-40b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFTFFFFFF??TFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064000339.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 DES-PT-40b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064000339
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K 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.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 115K 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 DES-PT-40b-LTLCardinality-00
FORMULA_NAME DES-PT-40b-LTLCardinality-01
FORMULA_NAME DES-PT-40b-LTLCardinality-02
FORMULA_NAME DES-PT-40b-LTLCardinality-03
FORMULA_NAME DES-PT-40b-LTLCardinality-04
FORMULA_NAME DES-PT-40b-LTLCardinality-05
FORMULA_NAME DES-PT-40b-LTLCardinality-06
FORMULA_NAME DES-PT-40b-LTLCardinality-07
FORMULA_NAME DES-PT-40b-LTLCardinality-08
FORMULA_NAME DES-PT-40b-LTLCardinality-09
FORMULA_NAME DES-PT-40b-LTLCardinality-10
FORMULA_NAME DES-PT-40b-LTLCardinality-11
FORMULA_NAME DES-PT-40b-LTLCardinality-12
FORMULA_NAME DES-PT-40b-LTLCardinality-13
FORMULA_NAME DES-PT-40b-LTLCardinality-14
FORMULA_NAME DES-PT-40b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748729932697
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 22:18:55] [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-31 22:18:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:18:55] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2025-05-31 22:18:55] [INFO ] Transformed 439 places.
[2025-05-31 22:18:55] [INFO ] Transformed 390 transitions.
[2025-05-31 22:18:55] [INFO ] Found NUPN structural information;
[2025-05-31 22:18:55] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 568 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-40b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 414 transition count 368
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 414 transition count 368
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 404 transition count 358
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 404 transition count 358
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 74 place count 404 transition count 351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 403 transition count 350
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 403 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 403 transition count 349
Applied a total of 77 rules in 315 ms. Remains 403 /439 variables (removed 36) and now considering 349/390 (removed 41) transitions.
// Phase 1: matrix 349 rows 403 cols
[2025-05-31 22:18:56] [INFO ] Computed 62 invariants in 82 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:18:57] [INFO ] Implicit Places using invariants in 1114 ms returned []
[2025-05-31 22:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:18:59] [INFO ] Implicit Places using invariants and state equation in 2125 ms returned []
Implicit Place search using SMT with State Equation took 3320 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-05-31 22:18:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 349/752 variables, 403/465 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:13] [INFO ] Deduced a trap composed of 10 places in 285 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:13] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:14] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:14] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:15] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:15] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:15] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:16] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:16] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:16] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:16] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:17] [INFO ] Deduced a trap composed of 8 places in 340 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:18] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:18] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:22] [INFO ] Deduced a trap composed of 29 places in 291 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:22] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:23] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 41 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 17/482 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/752 variables, and 482 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:36] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:37] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:37] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:37] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:37] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:38] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:38] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:41] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:41] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:41] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:41] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:41] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:42] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:42] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:42] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:42] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:43] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:43] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:44] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:44] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:44] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:44] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:44] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:44] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:44] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:44] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:44] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:45] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:45] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:45] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:46] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:46] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:46] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:49] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 18/113 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/752 variables, and 113 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/403 constraints, PredecessorRefiner: 0/348 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 60513ms
Starting structural reductions in LTL mode, iteration 1 : 403/439 places, 349/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64193 ms. Remains : 403/439 places, 349/390 transitions.
Support contains 42 out of 403 places after structural reductions.
[2025-05-31 22:20:00] [INFO ] Flatten gal took : 134 ms
[2025-05-31 22:20:00] [INFO ] Flatten gal took : 83 ms
[2025-05-31 22:20:00] [INFO ] Input system was already deterministic with 349 transitions.
Support contains 41 out of 403 places (down from 42) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (336 resets) in 2927 ms. (13 steps per ms) remains 12/22 properties
BEST_FIRST walk for 40004 steps (46 resets) in 241 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 235 ms. (169 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (48 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (48 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (47 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (47 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (47 resets) in 171 ms. (232 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (48 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (47 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (48 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (48 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
[2025-05-31 22:20:02] [INFO ] Invariant cache hit.
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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 64/84 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 99/183 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 201/384 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 3/387 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 335/722 variables, 387/449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/722 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 18/740 variables, 10/459 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/740 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 6/746 variables, 3/462 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/746 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 4/750 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/750 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 2/752 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/752 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/752 variables, and 465 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 64/84 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 99/183 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:07] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 201/384 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:08] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:08] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 23 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:09] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 3/387 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 335/722 variables, 387/453 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 11/464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:11] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:11] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:12] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 722/752 variables, and 467 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 387/403 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10045ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 349/349 transitions.
Graph (complete) has 910 edges and 403 vertex of which 396 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 396 transition count 330
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 383 transition count 328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 381 transition count 328
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 33 place count 381 transition count 319
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 51 place count 372 transition count 319
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 56 place count 367 transition count 314
Iterating global reduction 3 with 5 rules applied. Total rules applied 61 place count 367 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 367 transition count 311
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 66 place count 365 transition count 309
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 365 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 365 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 70 place count 365 transition count 306
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 72 place count 364 transition count 306
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 218 place count 291 transition count 233
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 289 transition count 235
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 225 place count 289 transition count 232
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 228 place count 286 transition count 232
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 286 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 230 place count 285 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 284 transition count 231
Applied a total of 231 rules in 312 ms. Remains 284 /403 variables (removed 119) and now considering 231/349 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 284/403 places, 231/349 transitions.
RANDOM walk for 40000 steps (1339 resets) in 1038 ms. (38 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (252 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (253 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (259 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (236 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (264 resets) in 145 ms. (274 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (255 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (210 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (242 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (246 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (268 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (239 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 373481 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :3 out of 12
Probabilistic random walk after 373481 steps, saw 86957 distinct states, run finished after 3007 ms. (steps per millisecond=124 ) properties seen :3
// Phase 1: matrix 231 rows 284 cols
[2025-05-31 22:20:16] [INFO ] Computed 60 invariants in 7 ms
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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/65 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 156/221 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 15/236 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/237 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 194/431 variables, 237/293 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 51/482 variables, 14/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 1/483 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/483 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/483 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 32/515 variables, 32/344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/515 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 344 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2284 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/65 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 156/221 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 15/236 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/237 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 194/431 variables, 237/293 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:20] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:21] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:22] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:22] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:22] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 13 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:24] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:26] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 5 ms to minimize.
Problem AtomicPropp22 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 1/305 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 51/482 variables, 14/319 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 3/322 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 4/326 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 1/483 variables, 1/327 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/483 variables, 1/328 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/328 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 32/515 variables, 32/360 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/515 variables, 0/360 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/515 variables, 0/360 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 360 constraints, problems are : Problem set: 1 solved, 8 unsolved in 21247 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23550ms problems are : Problem set: 1 solved, 8 unsolved
Parikh walk visited 0 properties in 29754 ms.
Support contains 13 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 231/231 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 284 transition count 229
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 282 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 281 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 281 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 9 place count 280 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 279 transition count 225
Applied a total of 10 rules in 67 ms. Remains 279 /284 variables (removed 5) and now considering 225/231 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 279/284 places, 225/231 transitions.
RANDOM walk for 40000 steps (1578 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (302 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (284 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (328 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (317 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (313 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (288 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (311 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (326 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 499943 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 8
Probabilistic random walk after 499943 steps, saw 78680 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
// Phase 1: matrix 225 rows 279 cols
[2025-05-31 22:21:13] [INFO ] Computed 60 invariants in 6 ms
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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 16/46 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 163/209 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 22/231 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/232 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 188/420 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 51/471 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/471 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/471 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/472 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/472 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 32/504 variables, 32/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/504 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 339 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 16/46 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 163/209 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 22/231 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/232 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 188/420 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:21:16] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 51/471 variables, 14/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/471 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 1/472 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/472 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 32/504 variables, 32/348 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/504 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:21:21] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 7 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/504 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/504 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 0/504 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 349 constraints, problems are : Problem set: 0 solved, 8 unsolved in 9586 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11117ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 30267 ms.
Support contains 13 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 225/225 transitions.
Applied a total of 0 rules in 15 ms. Remains 279 /279 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 279/279 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 225/225 transitions.
Applied a total of 0 rules in 12 ms. Remains 279 /279 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2025-05-31 22:21:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:21:55] [INFO ] Implicit Places using invariants in 333 ms returned []
[2025-05-31 22:21:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:21:56] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:21:56] [INFO ] Redundant transitions in 10 ms returned []
Running 221 sub problems to find dead transitions.
[2025-05-31 22:21:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 1/276 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 2/278 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 225/503 variables, 278/338 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:22:14] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:22:18] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:22:18] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:22:19] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/504 variables, and 342 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/276 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 2/278 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 225/503 variables, 278/342 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 221/563 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/504 variables, and 563 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61180 ms. Remains : 279/279 places, 225/225 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA DES-PT-40b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 910 edges and 403 vertex of which 396 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.29 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(((X(!p0)&&F(p1))||G(!p0))))'
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 396 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 396 transition count 342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 396 transition count 338
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 394 transition count 336
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 394 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 394 transition count 334
Applied a total of 24 rules in 38 ms. Remains 394 /403 variables (removed 9) and now considering 334/349 (removed 15) transitions.
// Phase 1: matrix 334 rows 394 cols
[2025-05-31 22:22:56] [INFO ] Computed 62 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:22:57] [INFO ] Implicit Places using invariants in 671 ms returned []
[2025-05-31 22:22:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:22:59] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 2829 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2025-05-31 22:22:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (OVERLAPS) 334/728 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:19] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:20] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:21] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:21] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:21] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:21] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:23] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:23] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:24] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:24] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:25] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:27] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 12 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/728 variables, and 468 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:34] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:35] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:35] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:35] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:35] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:35] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:36] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:36] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:36] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:36] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:37] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:37] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:38] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:38] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:38] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:38] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:38] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:38] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:41] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:41] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:42] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:42] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:42] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:42] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:42] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:42] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:42] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:43] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:46] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 9/103 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (OVERLAPS) 334/728 variables, 394/497 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/728 variables, 333/830 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 830 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 394/403 places, 334/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63010 ms. Remains : 394/403 places, 334/349 transitions.
Stuttering acceptance computed with spot in 342 ms :[p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-00
Product exploration explored 100000 steps with 2086 reset in 586 ms.
Stuttering criterion allowed to conclude after 996 steps with 19 reset in 6 ms.
FORMULA DES-PT-40b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-00 finished in 64069 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 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Graph (complete) has 910 edges and 403 vertex of which 396 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 395 transition count 329
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 380 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 380 transition count 319
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 370 transition count 319
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 364 transition count 313
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 364 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 364 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 67 place count 364 transition count 307
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 362 transition count 307
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 360 transition count 305
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 360 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 360 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 359 transition count 302
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 233 place count 282 transition count 225
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 237 place count 280 transition count 227
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 278 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 277 transition count 225
Applied a total of 240 rules in 183 ms. Remains 277 /403 variables (removed 126) and now considering 225/349 (removed 124) transitions.
// Phase 1: matrix 225 rows 277 cols
[2025-05-31 22:24:00] [INFO ] Computed 58 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:24:01] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-05-31 22:24:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:24:01] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:24:01] [INFO ] Redundant transitions in 34 ms returned []
Running 222 sub problems to find dead transitions.
[2025-05-31 22:24:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 2/276 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 225/501 variables, 276/334 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:24:11] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 1/502 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/502 variables, and 336 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 2/276 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 225/501 variables, 276/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 222/557 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/502 variables, and 557 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 277/403 places, 225/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61482 ms. Remains : 277/403 places, 225/349 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-01
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-01 finished in 61538 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((X((p1||X(p2)))&&p0))))'
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 396 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 396 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 396 transition count 339
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 394 transition count 337
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 394 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 394 transition count 335
Applied a total of 23 rules in 53 ms. Remains 394 /403 variables (removed 9) and now considering 335/349 (removed 14) transitions.
// Phase 1: matrix 335 rows 394 cols
[2025-05-31 22:25:02] [INFO ] Computed 62 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:25:02] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-05-31 22:25:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:25:04] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2025-05-31 22:25:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (OVERLAPS) 335/729 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:22] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:23] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:24] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:25] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:26] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:26] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:26] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:27] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:29] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 729/729 variables, and 465 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:39] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:40] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:40] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:40] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:40] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:40] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:40] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:41] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:41] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:41] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:41] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:42] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:42] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:42] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:42] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:42] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:45] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:45] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 18/89 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:47] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:47] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:47] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:47] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:47] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:48] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:48] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:48] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:48] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:48] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:48] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:48] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:48] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:48] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:49] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:49] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:25:49] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 17/106 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (OVERLAPS) 335/729 variables, 394/500 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 729/729 variables, and 834 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 394/403 places, 335/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62061 ms. Remains : 394/403 places, 335/349 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-03
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-03 finished in 62381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1&&X((!p1&&G(p0))))))'
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 397 transition count 343
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 397 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 397 transition count 341
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 395 transition count 339
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 395 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 395 transition count 337
Applied a total of 20 rules in 31 ms. Remains 395 /403 variables (removed 8) and now considering 337/349 (removed 12) transitions.
// Phase 1: matrix 337 rows 395 cols
[2025-05-31 22:26:04] [INFO ] Computed 62 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:26:05] [INFO ] Implicit Places using invariants in 556 ms returned []
[2025-05-31 22:26:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:26:06] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2402 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2025-05-31 22:26:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/395 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 336 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 337/732 variables, 395/457 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:28] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:29] [INFO ] Deduced a trap composed of 8 places in 338 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:29] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:30] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:30] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:31] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:31] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:31] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:31] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:31] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:32] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:32] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:32] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:32] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:33] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:33] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:33] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:33] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:33] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:34] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:36] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 12 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 732/732 variables, and 478 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/395 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:42] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:42] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:42] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:42] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:42] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:43] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:43] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:43] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:43] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:43] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:43] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:43] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:43] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:44] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:44] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:44] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:44] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:44] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:44] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:45] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:45] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:45] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:45] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:46] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:49] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:50] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:51] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:51] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:51] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:51] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:51] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:51] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:52] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:52] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:52] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:53] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:57] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:26:57] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/732 variables, and 121 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/395 constraints, PredecessorRefiner: 0/336 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 395/403 places, 337/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62556 ms. Remains : 395/403 places, 337/349 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (OR (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-04 finished in 62796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (p1&&X(X(G(p0)))))))'
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 397 transition count 343
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 397 transition count 343
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 397 transition count 340
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 396 transition count 339
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 396 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 396 transition count 338
Applied a total of 18 rules in 39 ms. Remains 396 /403 variables (removed 7) and now considering 338/349 (removed 11) transitions.
// Phase 1: matrix 338 rows 396 cols
[2025-05-31 22:27:07] [INFO ] Computed 62 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:27:07] [INFO ] Implicit Places using invariants in 577 ms returned []
[2025-05-31 22:27:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:27:09] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2025-05-31 22:27:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/396 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 338/734 variables, 396/458 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:21] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:22] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:22] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:23] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:23] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:23] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:23] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:24] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:24] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:24] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:25] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:25] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:25] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:25] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:25] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:25] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:26] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:26] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:26] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:26] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:31] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:31] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:34] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:34] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:36] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:36] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 32 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 6/484 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 734/734 variables, and 484 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/396 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 26/88 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:45] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:45] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:45] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:45] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:46] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:46] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:46] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:47] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:47] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:47] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:47] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:48] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:52] [INFO ] Deduced a trap composed of 13 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-31 22:27:52] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:52] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:52] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:52] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:53] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:53] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:53] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:54] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:57] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:59] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:59] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:59] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:59] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:59] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:27:59] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/734 variables, and 118 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/396 constraints, PredecessorRefiner: 0/337 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 396/403 places, 338/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62337 ms. Remains : 396/403 places, 338/349 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-40b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 3847 steps with 35 reset in 15 ms.
FORMULA DES-PT-40b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-05 finished in 62623 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 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Graph (complete) has 910 edges and 403 vertex of which 396 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 330
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 330
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 381 transition count 320
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 371 transition count 320
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 365 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 365 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 365 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 65 place count 365 transition count 308
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 363 transition count 308
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 361 transition count 306
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 361 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 361 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 75 place count 361 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 360 transition count 303
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 229 place count 284 transition count 227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 233 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 279 transition count 227
Applied a total of 236 rules in 114 ms. Remains 279 /403 variables (removed 124) and now considering 227/349 (removed 122) transitions.
// Phase 1: matrix 227 rows 279 cols
[2025-05-31 22:28:10] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:28:10] [INFO ] Implicit Places using invariants in 498 ms returned []
[2025-05-31 22:28:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:28:11] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:28:11] [INFO ] Redundant transitions in 4 ms returned []
Running 224 sub problems to find dead transitions.
[2025-05-31 22:28:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/278 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 227/505 variables, 278/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:28:24] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:28:24] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:28:33] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:28:37] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/506 variables, and 340 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/278 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 227/505 variables, 278/340 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 224/564 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 564 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 279/403 places, 227/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61642 ms. Remains : 279/403 places, 227/349 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-07
Product exploration explored 100000 steps with 4620 reset in 479 ms.
Product exploration explored 100000 steps with 4610 reset in 429 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1859 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (411 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 833696 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :0 out of 1
Probabilistic random walk after 833696 steps, saw 198189 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :0
[2025-05-31 22:29:15] [INFO ] Invariant cache hit.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/190 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/219 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 182/408 variables, 226/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/422 variables, 9/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/466 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/466 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/506 variables, 40/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/506 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:29:16] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 31/190 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/219 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/226 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 182/408 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/422 variables, 9/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 44/466 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/466 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/466 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 40/506 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/506 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/506 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1081ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 659 ms.
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 278 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 278 transition count 225
Applied a total of 4 rules in 39 ms. Remains 278 /279 variables (removed 1) and now considering 225/227 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 278/279 places, 225/227 transitions.
RANDOM walk for 40000 steps (1793 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (391 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 747914 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :0 out of 1
Probabilistic random walk after 747914 steps, saw 170173 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
// Phase 1: matrix 225 rows 278 cols
[2025-05-31 22:29:20] [INFO ] Computed 59 invariants in 3 ms
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/194 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/219 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 180/406 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/420 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/464 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/464 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 39/503 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/503 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/194 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/219 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 180/406 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/420 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/464 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/464 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 39/503 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/503 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1084ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 720 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 13 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 12 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2025-05-31 22:29:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:29:23] [INFO ] Implicit Places using invariants in 479 ms returned []
[2025-05-31 22:29:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:29:23] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:29:23] [INFO ] Redundant transitions in 12 ms returned []
Running 222 sub problems to find dead transitions.
[2025-05-31 22:29:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/277 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 225/502 variables, 277/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:29:32] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:29:33] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:29:33] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:29:34] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:29:38] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:29:42] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 1/503 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/503 variables, and 343 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 225/502 variables, 277/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 222/564 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/503 variables, and 564 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/278 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61261 ms. Remains : 278/278 places, 225/225 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 225
Applied a total of 1 rules in 14 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2025-05-31 22:30:23] [INFO ] Computed 59 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:30:23] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:30:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 22:30:24] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-31 22:30:24] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 22:30:24] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 22:30:24] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 495 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 8 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
// Phase 1: matrix 227 rows 279 cols
[2025-05-31 22:30:24] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:24] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-05-31 22:30:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:30:25] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:30:25] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2025-05-31 22:30:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/278 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 227/505 variables, 278/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:38] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:47] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:52] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/506 variables, and 340 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/278 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 227/505 variables, 278/340 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 224/564 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 564 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61414 ms. Remains : 279/279 places, 227/227 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1862 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (381 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 837275 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 837275 steps, saw 198892 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2025-05-31 22:31:29] [INFO ] Invariant cache hit.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/190 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/219 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 182/408 variables, 226/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/422 variables, 9/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/466 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/466 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/506 variables, 40/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/506 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:29] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 31/190 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/219 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/226 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 182/408 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/422 variables, 9/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 44/466 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/466 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/466 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 40/506 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/506 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/506 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1098ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 632 ms.
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 278 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 278 transition count 225
Applied a total of 4 rules in 21 ms. Remains 278 /279 variables (removed 1) and now considering 225/227 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 278/279 places, 225/227 transitions.
RANDOM walk for 40000 steps (1770 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (397 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 904485 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 904485 steps, saw 205481 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
// Phase 1: matrix 225 rows 278 cols
[2025-05-31 22:31:34] [INFO ] Computed 59 invariants in 3 ms
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/194 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/219 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 180/406 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/420 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/464 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/464 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 39/503 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/503 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/194 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/219 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 180/406 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/420 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/464 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/464 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 39/503 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/503 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 979ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 753 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 11 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 10 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2025-05-31 22:31:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:31:36] [INFO ] Implicit Places using invariants in 427 ms returned []
[2025-05-31 22:31:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:31:36] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:31:36] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2025-05-31 22:31:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/277 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 225/502 variables, 277/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:47] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:47] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:48] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:48] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:52] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:31:56] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 1/503 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/503 variables, and 343 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 225/502 variables, 277/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 222/564 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/503 variables, and 564 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/278 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61134 ms. Remains : 278/278 places, 225/225 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 225
Applied a total of 1 rules in 27 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2025-05-31 22:32:36] [INFO ] Computed 59 invariants in 5 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:32:37] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:32:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-31 22:32:37] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 33 ms returned sat
[2025-05-31 22:32:37] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 22:32:37] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 22:32:37] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 700 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4690 reset in 382 ms.
Product exploration explored 100000 steps with 4631 reset in 443 ms.
Built C files in :
/tmp/ltsmin11106305293570185250
[2025-05-31 22:32:38] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2025-05-31 22:32:38] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:32:38] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2025-05-31 22:32:38] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:32:38] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2025-05-31 22:32:38] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:32:38] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11106305293570185250
Running compilation step : cd /tmp/ltsmin11106305293570185250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1432 ms.
Running link step : cd /tmp/ltsmin11106305293570185250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin11106305293570185250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2652137644181815968.hoa' '--buchi-type=spotba'
LTSmin run took 6345 ms.
FORMULA DES-PT-40b-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLCardinality-07 finished in 276932 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((X((X(X(p1))&&p0))||(p2 U p3))))'
Support contains 7 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 396 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 396 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 396 transition count 339
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 394 transition count 337
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 394 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 394 transition count 335
Applied a total of 23 rules in 35 ms. Remains 394 /403 variables (removed 9) and now considering 335/349 (removed 14) transitions.
// Phase 1: matrix 335 rows 394 cols
[2025-05-31 22:32:46] [INFO ] Computed 62 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:32:47] [INFO ] Implicit Places using invariants in 423 ms returned []
[2025-05-31 22:32:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:32:48] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2025-05-31 22:32:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (OVERLAPS) 335/729 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:04] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:05] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:06] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:07] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:07] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:08] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:08] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:08] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:10] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 9/465 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:16] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:16] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:17] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:18] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:18] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:18] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:18] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:18] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 16 ms to minimize.
SMT process timed out in 30248ms, After SMT, problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 30250ms
Starting structural reductions in LTL mode, iteration 1 : 394/403 places, 335/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32125 ms. Remains : 394/403 places, 335/349 transitions.
Stuttering acceptance computed with spot in 499 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p1), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-08
Stuttering criterion allowed to conclude after 4752 steps with 106 reset in 15 ms.
FORMULA DES-PT-40b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-08 finished in 32677 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((X(X(X(X(X(X(F(p1)))))))||p0))))'
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Graph (complete) has 910 edges and 403 vertex of which 396 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 395 transition count 329
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 380 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 380 transition count 319
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 370 transition count 319
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 364 transition count 313
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 364 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 364 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 67 place count 364 transition count 307
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 362 transition count 307
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 360 transition count 305
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 360 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 360 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 359 transition count 302
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 221 place count 288 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 286 transition count 233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 284 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 283 transition count 231
Applied a total of 228 rules in 102 ms. Remains 283 /403 variables (removed 120) and now considering 231/349 (removed 118) transitions.
// Phase 1: matrix 231 rows 283 cols
[2025-05-31 22:33:19] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:20] [INFO ] Implicit Places using invariants in 445 ms returned []
[2025-05-31 22:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:33:20] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:33:20] [INFO ] Redundant transitions in 1 ms returned []
Running 226 sub problems to find dead transitions.
[2025-05-31 22:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/280 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 2/282 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 231/513 variables, 282/340 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:38] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:39] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:39] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:33:40] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/514 variables, and 344 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/283 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/280 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 2/282 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 231/513 variables, 282/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 226/570 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/514 variables, and 570 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/283 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in SI_LTL mode, iteration 1 : 283/403 places, 231/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61477 ms. Remains : 283/403 places, 231/349 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-09
Product exploration explored 100000 steps with 4579 reset in 255 ms.
Product exploration explored 100000 steps with 4595 reset in 466 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1831 resets) in 162 ms. (245 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (308 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (304 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (299 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
[2025-05-31 22:34:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/47 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/198 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/221 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 11/232 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 187/419 variables, 232/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/431 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 43/474 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/474 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 40/514 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/514 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/514 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 341 constraints, problems are : Problem set: 0 solved, 3 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/47 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/198 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/221 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:23] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 11/232 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 12/431 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 43/474 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/474 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 40/514 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/514 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/514 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 345 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2256ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4623 ms.
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 231/231 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 283 transition count 230
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 283 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 229
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 282 transition count 229
Applied a total of 4 rules in 19 ms. Remains 282 /283 variables (removed 1) and now considering 229/231 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 282/283 places, 229/231 transitions.
RANDOM walk for 40000 steps (1777 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (298 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (311 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (333 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 789230 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 3
Probabilistic random walk after 789230 steps, saw 108190 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
// Phase 1: matrix 229 rows 282 cols
[2025-05-31 22:34:32] [INFO ] Computed 59 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/47 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/198 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/225 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/232 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 185/417 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/429 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 43/472 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/472 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 39/511 variables, 39/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 341 constraints, problems are : Problem set: 0 solved, 3 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/47 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/198 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/225 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:32] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/232 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 185/417 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 12/429 variables, 7/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/429 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 43/472 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 39/511 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/511 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/511 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 345 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1318 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1734ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4490 ms.
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 229/229 transitions.
Applied a total of 0 rules in 6 ms. Remains 282 /282 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 282/282 places, 229/229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 229/229 transitions.
Applied a total of 0 rules in 5 ms. Remains 282 /282 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2025-05-31 22:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:34:38] [INFO ] Implicit Places using invariants in 308 ms returned []
[2025-05-31 22:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:34:39] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:34:39] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2025-05-31 22:34:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/281 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 229/510 variables, 281/340 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:55] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:56] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:57] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:57] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:58] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:58] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:34:59] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:02] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:35:02] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/511 variables, and 349 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 281/282 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/279 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 2/281 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 229/510 variables, 281/349 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 224/573 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/511 variables, and 573 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 281/282 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61085 ms. Remains : 282/282 places, 229/229 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 282 transition count 229
Applied a total of 1 rules in 19 ms. Remains 282 /282 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 229 rows 282 cols
[2025-05-31 22:35:39] [INFO ] Computed 59 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:35:39] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:35:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 22:35:39] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-31 22:35:40] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-05-31 22:35:40] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-05-31 22:35:40] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 730 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 338 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 231/231 transitions.
Applied a total of 0 rules in 9 ms. Remains 283 /283 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 283 cols
[2025-05-31 22:35:40] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:35:41] [INFO ] Implicit Places using invariants in 423 ms returned []
[2025-05-31 22:35:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:35:42] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:35:42] [INFO ] Redundant transitions in 2 ms returned []
Running 226 sub problems to find dead transitions.
[2025-05-31 22:35:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/280 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 2/282 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 231/513 variables, 282/340 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:00] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:00] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:01] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:01] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/514 variables, and 344 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/283 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/280 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 2/282 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 231/513 variables, 282/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 226/570 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/514 variables, and 570 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/283 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61451 ms. Remains : 283/283 places, 231/231 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1845 resets) in 187 ms. (212 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (298 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (322 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (317 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
[2025-05-31 22:36:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/47 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/198 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/221 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 11/232 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 187/419 variables, 232/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/431 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 43/474 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/474 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 40/514 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/514 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/514 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 341 constraints, problems are : Problem set: 0 solved, 3 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/47 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/198 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/221 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:43] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 11/232 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 12/431 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 43/474 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/474 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 40/514 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/514 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/514 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 345 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1612 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2248ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4689 ms.
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 231/231 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 283 transition count 230
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 283 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 229
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 282 transition count 229
Applied a total of 4 rules in 19 ms. Remains 282 /283 variables (removed 1) and now considering 229/231 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 282/283 places, 229/231 transitions.
RANDOM walk for 40000 steps (1771 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (301 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (317 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (311 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 798957 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 3
Probabilistic random walk after 798957 steps, saw 109438 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
// Phase 1: matrix 229 rows 282 cols
[2025-05-31 22:36:53] [INFO ] Computed 59 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/47 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/198 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/225 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/232 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 185/417 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/429 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 43/472 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/472 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 39/511 variables, 39/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 341 constraints, problems are : Problem set: 0 solved, 3 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/47 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/198 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/225 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:36:53] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/232 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 185/417 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 12/429 variables, 7/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/429 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 43/472 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 39/511 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/511 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/511 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 345 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2098ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4403 ms.
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 229/229 transitions.
Applied a total of 0 rules in 5 ms. Remains 282 /282 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 282/282 places, 229/229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 229/229 transitions.
Applied a total of 0 rules in 5 ms. Remains 282 /282 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2025-05-31 22:36:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:36:59] [INFO ] Implicit Places using invariants in 275 ms returned []
[2025-05-31 22:36:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:37:00] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:37:00] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2025-05-31 22:37:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/281 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 229/510 variables, 281/340 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:16] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:17] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:17] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:17] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:18] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:18] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:19] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:23] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:37:23] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/511 variables, and 349 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 281/282 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/279 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 2/281 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 229/510 variables, 281/349 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 224/573 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/511 variables, and 573 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 281/282 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60920 ms. Remains : 282/282 places, 229/229 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 282 transition count 229
Applied a total of 1 rules in 10 ms. Remains 282 /282 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 229 rows 282 cols
[2025-05-31 22:38:00] [INFO ] Computed 59 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:38:00] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:38:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-05-31 22:38:00] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 22 ms returned sat
[2025-05-31 22:38:00] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-05-31 22:38:01] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-05-31 22:38:01] [INFO ] After 756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 863 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4620 reset in 408 ms.
Product exploration explored 100000 steps with 4583 reset in 462 ms.
Built C files in :
/tmp/ltsmin4803284417615772291
[2025-05-31 22:38:02] [INFO ] Computing symmetric may disable matrix : 231 transitions.
[2025-05-31 22:38:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:38:02] [INFO ] Computing symmetric may enable matrix : 231 transitions.
[2025-05-31 22:38:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:38:02] [INFO ] Computing Do-Not-Accords matrix : 231 transitions.
[2025-05-31 22:38:02] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:38:02] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4803284417615772291
Running compilation step : cd /tmp/ltsmin4803284417615772291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1102 ms.
Running link step : cd /tmp/ltsmin4803284417615772291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4803284417615772291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13823131699179156140.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 231/231 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 283 cols
[2025-05-31 22:38:18] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:38:18] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-05-31 22:38:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:38:19] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:38:19] [INFO ] Redundant transitions in 1 ms returned []
Running 226 sub problems to find dead transitions.
[2025-05-31 22:38:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/280 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 2/282 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 231/513 variables, 282/340 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:38:35] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:38:35] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:38:36] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:38:36] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/514 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 345 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/280 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 2/282 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 231/513 variables, 282/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 226/570 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/514 variables, and 570 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/283 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61265 ms. Remains : 283/283 places, 231/231 transitions.
Built C files in :
/tmp/ltsmin6017691086981184989
[2025-05-31 22:39:19] [INFO ] Computing symmetric may disable matrix : 231 transitions.
[2025-05-31 22:39:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:39:19] [INFO ] Computing symmetric may enable matrix : 231 transitions.
[2025-05-31 22:39:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:39:19] [INFO ] Computing Do-Not-Accords matrix : 231 transitions.
[2025-05-31 22:39:19] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:39:19] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6017691086981184989
Running compilation step : cd /tmp/ltsmin6017691086981184989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 950 ms.
Running link step : cd /tmp/ltsmin6017691086981184989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6017691086981184989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15507763817082854969.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 22:39:34] [INFO ] Flatten gal took : 27 ms
[2025-05-31 22:39:34] [INFO ] Flatten gal took : 26 ms
[2025-05-31 22:39:34] [INFO ] Time to serialize gal into /tmp/LTL10843349715542160684.gal : 8 ms
[2025-05-31 22:39:34] [INFO ] Time to serialize properties into /tmp/LTL12041427351568331014.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/LTL10843349715542160684.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15091379897736343374.hoa' '-atoms' '/tmp/LTL12041427351568331014.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...320
Loading property file /tmp/LTL12041427351568331014.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15091379897736343374.hoa
Detected timeout of ITS tools.
[2025-05-31 22:39:49] [INFO ] Flatten gal took : 25 ms
[2025-05-31 22:39:49] [INFO ] Flatten gal took : 21 ms
[2025-05-31 22:39:49] [INFO ] Time to serialize gal into /tmp/LTL3747588389954591757.gal : 6 ms
[2025-05-31 22:39:49] [INFO ] Time to serialize properties into /tmp/LTL11137401263101790767.ltl : 2 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/LTL3747588389954591757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11137401263101790767.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p308==0)||(p373==1))")||(X(X(X(X(X(X(F("((p134==0)||(p279==1))"))))))))))))
Formula 0 simplified : G(F!"((p308==0)||(p373==1))" & FG!"((p134==0)||(p279==1))")
Detected timeout of ITS tools.
[2025-05-31 22:40:04] [INFO ] Flatten gal took : 20 ms
[2025-05-31 22:40:04] [INFO ] Applying decomposition
[2025-05-31 22:40:04] [INFO ] Flatten gal took : 19 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/graph5628990852619931508.txt' '-o' '/tmp/graph5628990852619931508.bin' '-w' '/tmp/graph5628990852619931508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5628990852619931508.bin' '-l' '-1' '-v' '-w' '/tmp/graph5628990852619931508.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:40:04] [INFO ] Decomposing Gal with order
[2025-05-31 22:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:40:04] [INFO ] Removed a total of 77 redundant transitions.
[2025-05-31 22:40:05] [INFO ] Flatten gal took : 83 ms
[2025-05-31 22:40:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 12 ms.
[2025-05-31 22:40:05] [INFO ] Time to serialize gal into /tmp/LTL7839749964561165056.gal : 7 ms
[2025-05-31 22:40:05] [INFO ] Time to serialize properties into /tmp/LTL13650253767623871493.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/LTL7839749964561165056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13650253767623871493.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i5.i0.u13.p308==0)||(i6.i3.u30.p373==1))")||(X(X(X(X(X(X(F("((u2.p134==0)||(i0.u7.p279==1))"))))))))))))
Formula 0 simplified : G(F!"((i5.i0.u13.p308==0)||(i6.i3.u30.p373==1))" & FG!"((u2.p134==0)||(i0.u7.p279==1))")
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLCardinality-09 finished in 420576 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 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 395 transition count 341
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 395 transition count 341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 395 transition count 337
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 393 transition count 335
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 393 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 393 transition count 333
Applied a total of 26 rules in 23 ms. Remains 393 /403 variables (removed 10) and now considering 333/349 (removed 16) transitions.
// Phase 1: matrix 333 rows 393 cols
[2025-05-31 22:40:20] [INFO ] Computed 62 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:40:20] [INFO ] Implicit Places using invariants in 514 ms returned []
[2025-05-31 22:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:40:22] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-05-31 22:40:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:34] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:35] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:35] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:36] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:36] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:36] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:37] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:37] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:37] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:37] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:38] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:38] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:38] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:38] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:39] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:39] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:40] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:40] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:45] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:45] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 39 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:48] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:48] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:48] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:49] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:49] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:49] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:49] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 482 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:58] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:58] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:59] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:59] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:59] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:59] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:59] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:59] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:59] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:40:59] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:00] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:00] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:00] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:00] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:00] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:01] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:01] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:01] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:01] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:01] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:02] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:02] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:02] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:02] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:02] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:03] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 333/726 variables, 393/508 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 332/840 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 840 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 393/403 places, 333/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62596 ms. Remains : 393/403 places, 333/349 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-10
Product exploration explored 100000 steps with 894 reset in 313 ms.
Product exploration explored 100000 steps with 884 reset in 356 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (352 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (66 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 783910 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 1
Probabilistic random walk after 783910 steps, saw 130139 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
[2025-05-31 22:41:26] [INFO ] Invariant cache hit.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/163 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 167/330 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/378 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/163 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 167/330 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/378 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/716 variables, 10/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/716 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/722 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/722 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/724 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/724 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/726 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/726 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/726 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1641ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 282 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 387 transition count 311
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 370 transition count 311
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 370 transition count 300
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 282 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 280 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 280 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 279 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 278 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 277 transition count 223
Applied a total of 222 rules in 65 ms. Remains 277 /393 variables (removed 116) and now considering 223/333 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 277/393 places, 223/333 transitions.
RANDOM walk for 40000 steps (1724 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (272 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1020426 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1020426 steps, saw 137137 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
// Phase 1: matrix 223 rows 277 cols
[2025-05-31 22:41:31] [INFO ] Computed 60 invariants in 2 ms
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/218 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/225 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/417 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/419 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/461 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/461 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/461 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/500 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:32] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/218 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/225 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 179/404 variables, 225/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/417 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/419 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/461 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/461 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/461 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/500 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1150ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 112 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 9 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 277/277 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2025-05-31 22:41:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:41:33] [INFO ] Implicit Places using invariants in 494 ms returned []
[2025-05-31 22:41:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:41:34] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:41:34] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2025-05-31 22:41:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/276 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 223/499 variables, 276/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:45] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:52] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:52] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:53] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:53] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:57] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:41:58] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/500 variables, and 343 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 2/276 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 223/499 variables, 276/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 220/563 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/500 variables, and 563 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61333 ms. Remains : 277/277 places, 223/223 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 223
Applied a total of 1 rules in 10 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 277 cols
[2025-05-31 22:42:34] [INFO ] Computed 60 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:42:34] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:42:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-31 22:42:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2025-05-31 22:42:35] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 22:42:35] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 22:42:35] [INFO ] After 461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 545 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 10 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2025-05-31 22:42:35] [INFO ] Computed 62 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:42:36] [INFO ] Implicit Places using invariants in 587 ms returned []
[2025-05-31 22:42:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:42:37] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2324 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-05-31 22:42:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:49] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:50] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:50] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:51] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:51] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:51] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:52] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:52] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:52] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:53] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:53] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:53] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:53] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:53] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:54] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:55] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:55] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:42:55] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:00] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:00] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 36 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:03] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:03] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:04] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:04] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:04] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:04] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:04] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 482 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:13] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:14] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:14] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:14] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:14] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:14] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:14] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:14] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:15] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:15] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:15] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:15] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:15] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:15] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:15] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:16] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:16] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:16] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:16] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:16] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:17] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:17] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:17] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:17] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:18] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:18] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 333/726 variables, 393/508 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 332/840 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 840 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in LTL mode , in 1 iterations and 62432 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (356 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (66 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 714373 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 1
Probabilistic random walk after 714373 steps, saw 119687 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
[2025-05-31 22:43:41] [INFO ] Invariant cache hit.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/163 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 167/330 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/378 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/163 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 167/330 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/378 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/716 variables, 10/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/716 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/722 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/722 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/724 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/724 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/726 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/726 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/726 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1675ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 387 transition count 311
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 370 transition count 311
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 370 transition count 300
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 282 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 280 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 280 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 279 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 278 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 277 transition count 223
Applied a total of 222 rules in 46 ms. Remains 277 /393 variables (removed 116) and now considering 223/333 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 277/393 places, 223/333 transitions.
RANDOM walk for 40000 steps (1757 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (276 resets) in 145 ms. (274 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1043536 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 1
Probabilistic random walk after 1043536 steps, saw 139887 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
// Phase 1: matrix 223 rows 277 cols
[2025-05-31 22:43:46] [INFO ] Computed 60 invariants in 3 ms
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/218 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/225 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/417 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/419 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/461 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/461 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/461 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/500 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:46] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/218 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/225 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 179/404 variables, 225/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/417 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/419 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/461 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/461 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/461 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/500 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 756 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1090ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 277/277 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2025-05-31 22:43:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:43:48] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-05-31 22:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:43:48] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:43:48] [INFO ] Redundant transitions in 0 ms returned []
Running 220 sub problems to find dead transitions.
[2025-05-31 22:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/276 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 223/499 variables, 276/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:59] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:44:07] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:44:07] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:44:07] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:44:08] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:44:11] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:44:11] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/500 variables, and 343 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 2/276 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 223/499 variables, 276/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 220/563 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/500 variables, and 563 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61297 ms. Remains : 277/277 places, 223/223 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 223
Applied a total of 1 rules in 10 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 277 cols
[2025-05-31 22:44:48] [INFO ] Computed 60 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:44:49] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:44:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-31 22:44:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-31 22:44:49] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 22:44:49] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 22:44:49] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 458 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 872 reset in 313 ms.
Product exploration explored 100000 steps with 894 reset in 371 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 387 transition count 330
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 16 place count 387 transition count 332
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 387 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 382 transition count 327
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 382 transition count 327
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 111 place count 382 transition count 330
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 121 place count 372 transition count 320
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 131 place count 372 transition count 320
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 91 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 372 transition count 346
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 370 transition count 340
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 370 transition count 340
Deduced a syphon composed of 89 places in 0 ms
Applied a total of 141 rules in 168 ms. Remains 370 /393 variables (removed 23) and now considering 340/333 (removed -7) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:44:51] [INFO ] Redundant transitions in 4 ms returned []
Running 339 sub problems to find dead transitions.
// Phase 1: matrix 340 rows 370 cols
[2025-05-31 22:44:51] [INFO ] Computed 59 invariants in 6 ms
[2025-05-31 22:44:51] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 1/370 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 339 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 5 (OVERLAPS) 340/710 variables, 370/429 constraints. Problems are: Problem set: 112 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 16/445 constraints. Problems are: Problem set: 112 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 710/710 variables, and 445 constraints, problems are : Problem set: 112 solved, 227 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 370/370 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 112 solved, 227 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 13/13 constraints. Problems are: Problem set: 112 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/13 constraints. Problems are: Problem set: 112 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 68/348 variables, 32/45 constraints. Problems are: Problem set: 112 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/45 constraints. Problems are: Problem set: 112 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 15/363 variables, 14/59 constraints. Problems are: Problem set: 112 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/59 constraints. Problems are: Problem set: 112 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 336/699 variables, 363/422 constraints. Problems are: Problem set: 112 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/699 variables, 16/438 constraints. Problems are: Problem set: 112 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/699 variables, 227/665 constraints. Problems are: Problem set: 112 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/710 variables, and 665 constraints, problems are : Problem set: 112 solved, 227 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 363/370 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 227/339 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 112 solved, 227 unsolved
Search for dead transitions found 112 dead transitions in 60213ms
Found 112 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 112 transitions
Dead transitions reduction (with SMT) removed 112 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 370/393 places, 228/333 transitions.
Graph (complete) has 973 edges and 370 vertex of which 281 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.0 ms
Discarding 89 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 281 /370 variables (removed 89) and now considering 228/228 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 281/393 places, 228/333 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60408 ms. Remains : 281/393 places, 228/333 transitions.
Built C files in :
/tmp/ltsmin6736676458012045254
[2025-05-31 22:45:51] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6736676458012045254
Running compilation step : cd /tmp/ltsmin6736676458012045254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1006 ms.
Running link step : cd /tmp/ltsmin6736676458012045254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6736676458012045254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14769065131852362910.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 11 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2025-05-31 22:46:06] [INFO ] Computed 62 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:46:07] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-05-31 22:46:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:46:08] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-05-31 22:46:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:18] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:19] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:19] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:20] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:21] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:21] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:21] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:21] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:22] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:22] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:22] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:23] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:23] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:23] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:24] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:24] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:24] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:25] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:29] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:29] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 37 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:32] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:33] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:33] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:33] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:33] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:33] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:34] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 482 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:44] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:44] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:48] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:48] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:48] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:48] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:46:49] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 333/726 variables, 393/508 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 332/840 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 840 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in LTL mode , in 1 iterations and 61947 ms. Remains : 393/393 places, 333/333 transitions.
Built C files in :
/tmp/ltsmin3983578908345985453
[2025-05-31 22:47:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3983578908345985453
Running compilation step : cd /tmp/ltsmin3983578908345985453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 788 ms.
Running link step : cd /tmp/ltsmin3983578908345985453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3983578908345985453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7097328787787400835.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 22:47:23] [INFO ] Flatten gal took : 37 ms
[2025-05-31 22:47:23] [INFO ] Flatten gal took : 20 ms
[2025-05-31 22:47:23] [INFO ] Time to serialize gal into /tmp/LTL14569924625966889836.gal : 3 ms
[2025-05-31 22:47:23] [INFO ] Time to serialize properties into /tmp/LTL3394681060046862572.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/LTL14569924625966889836.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5636138628776529913.hoa' '-atoms' '/tmp/LTL3394681060046862572.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/LTL3394681060046862572.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5636138628776529913.hoa
Detected timeout of ITS tools.
[2025-05-31 22:47:39] [INFO ] Flatten gal took : 20 ms
[2025-05-31 22:47:39] [INFO ] Flatten gal took : 16 ms
[2025-05-31 22:47:39] [INFO ] Time to serialize gal into /tmp/LTL16004599791342571635.gal : 2 ms
[2025-05-31 22:47:39] [INFO ] Time to serialize properties into /tmp/LTL11320961332854856188.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/LTL16004599791342571635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11320961332854856188.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 : !((X(X(G("((p40==0)||(p221==1))")))))
Formula 0 simplified : XXF!"((p40==0)||(p221==1))"
Detected timeout of ITS tools.
[2025-05-31 22:47:54] [INFO ] Flatten gal took : 16 ms
[2025-05-31 22:47:54] [INFO ] Applying decomposition
[2025-05-31 22:47:54] [INFO ] Flatten gal took : 14 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/graph608228013675580418.txt' '-o' '/tmp/graph608228013675580418.bin' '-w' '/tmp/graph608228013675580418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph608228013675580418.bin' '-l' '-1' '-v' '-w' '/tmp/graph608228013675580418.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:47:54] [INFO ] Decomposing Gal with order
[2025-05-31 22:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:47:54] [INFO ] Removed a total of 11 redundant transitions.
[2025-05-31 22:47:54] [INFO ] Flatten gal took : 28 ms
[2025-05-31 22:47:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-05-31 22:47:54] [INFO ] Time to serialize gal into /tmp/LTL8544470616424270119.gal : 9 ms
[2025-05-31 22:47:54] [INFO ] Time to serialize properties into /tmp/LTL7178744547941151118.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/LTL8544470616424270119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7178744547941151118.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 : !((X(X(G("((i5.u32.p40==0)||(i2.u13.p221==1))")))))
Formula 0 simplified : XXF!"((i5.u32.p40==0)||(i2.u13.p221==1))"
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLCardinality-10 finished in 469243 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(p0))'
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Graph (complete) has 910 edges and 403 vertex of which 396 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 395 transition count 329
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 380 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 380 transition count 319
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 370 transition count 319
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 364 transition count 313
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 364 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 364 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 67 place count 364 transition count 307
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 362 transition count 307
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 360 transition count 305
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 360 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 360 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 359 transition count 302
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 233 place count 282 transition count 225
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 237 place count 280 transition count 227
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 278 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 277 transition count 225
Applied a total of 240 rules in 57 ms. Remains 277 /403 variables (removed 126) and now considering 225/349 (removed 124) transitions.
// Phase 1: matrix 225 rows 277 cols
[2025-05-31 22:48:09] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:48:09] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-05-31 22:48:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:48:10] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:48:10] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2025-05-31 22:48:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 2/276 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 225/501 variables, 276/334 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:48:20] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 1/502 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/502 variables, and 336 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 2/276 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 225/501 variables, 276/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 222/557 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/502 variables, and 557 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in SI_LTL mode, iteration 1 : 277/403 places, 225/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61264 ms. Remains : 277/403 places, 225/349 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-12
Product exploration explored 100000 steps with 5367 reset in 314 ms.
Product exploration explored 100000 steps with 5418 reset in 401 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/277 stabilizing places and 169/225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2174 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (401 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1023809 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :0 out of 1
Probabilistic random walk after 1023809 steps, saw 143438 distinct states, run finished after 3008 ms. (steps per millisecond=340 ) properties seen :0
[2025-05-31 22:49:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/188 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/404 variables, 224/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/418 variables, 9/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/462 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/502 variables, 40/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/502 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/188 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/404 variables, 224/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/418 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/462 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/502 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/502 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/502 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 701 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 225/225 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 277 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 276 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 276 transition count 223
Applied a total of 4 rules in 29 ms. Remains 276 /277 variables (removed 1) and now considering 223/225 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 276/277 places, 223/225 transitions.
RANDOM walk for 40000 steps (2092 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (398 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1113284 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :0 out of 1
Probabilistic random walk after 1113284 steps, saw 155263 distinct states, run finished after 3001 ms. (steps per millisecond=370 ) properties seen :0
// Phase 1: matrix 223 rows 276 cols
[2025-05-31 22:49:19] [INFO ] Computed 59 invariants in 8 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/416 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/460 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 39/499 variables, 39/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/499 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/416 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/460 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/460 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 39/499 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/499 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/499 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1112ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 720 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 276/276 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2025-05-31 22:49:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:49:21] [INFO ] Implicit Places using invariants in 463 ms returned []
[2025-05-31 22:49:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:49:22] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:49:22] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2025-05-31 22:49:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/275 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 223/498 variables, 275/334 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/499 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:49:46] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/499 variables, and 338 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 223/498 variables, 275/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 220/557 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/499 variables, and 557 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/276 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61406 ms. Remains : 276/276 places, 223/223 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 223
Applied a total of 1 rules in 16 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 276 cols
[2025-05-31 22:50:22] [INFO ] Computed 59 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:50:22] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-31 22:50:23] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 30 ms returned sat
[2025-05-31 22:50:23] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:50:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2025-05-31 22:50:23] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 30 ms returned sat
[2025-05-31 22:50:23] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 22:50:23] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 22:50:23] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 626 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 225/225 transitions.
Applied a total of 0 rules in 10 ms. Remains 277 /277 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 277 cols
[2025-05-31 22:50:23] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:50:24] [INFO ] Implicit Places using invariants in 471 ms returned []
[2025-05-31 22:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:50:24] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:50:24] [INFO ] Redundant transitions in 0 ms returned []
Running 222 sub problems to find dead transitions.
[2025-05-31 22:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 2/276 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 225/501 variables, 276/334 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:50:34] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 1/502 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/502 variables, and 336 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 2/276 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 225/501 variables, 276/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 222/557 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/502 variables, and 557 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61285 ms. Remains : 277/277 places, 225/225 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/277 stabilizing places and 169/225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2209 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (421 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1013064 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1013064 steps, saw 142001 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
[2025-05-31 22:51:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/188 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/404 variables, 224/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/418 variables, 9/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/462 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/502 variables, 40/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/502 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/188 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/404 variables, 224/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/418 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/462 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/502 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/502 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/502 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 802ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 501 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 225/225 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 277 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 276 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 276 transition count 223
Applied a total of 4 rules in 17 ms. Remains 276 /277 variables (removed 1) and now considering 223/225 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 276/277 places, 223/225 transitions.
RANDOM walk for 40000 steps (2138 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (373 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 941321 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 941321 steps, saw 131542 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
// Phase 1: matrix 223 rows 276 cols
[2025-05-31 22:51:32] [INFO ] Computed 59 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/416 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/460 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 39/499 variables, 39/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/499 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/416 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/460 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/460 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 39/499 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/499 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/499 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1041ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 728 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 276/276 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2025-05-31 22:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:51:34] [INFO ] Implicit Places using invariants in 478 ms returned []
[2025-05-31 22:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:51:35] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:51:35] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2025-05-31 22:51:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/275 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 223/498 variables, 275/334 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:51:46] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:51:46] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/499 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:51:58] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/499 variables, and 338 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 223/498 variables, 275/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 220/557 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/499 variables, and 557 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/276 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61219 ms. Remains : 276/276 places, 223/223 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 223
Applied a total of 1 rules in 11 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 276 cols
[2025-05-31 22:52:35] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:52:35] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-31 22:52:35] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 22 ms returned sat
[2025-05-31 22:52:35] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:52:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2025-05-31 22:52:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 33 ms returned sat
[2025-05-31 22:52:36] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 22:52:36] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 22:52:36] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 628 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 5433 reset in 386 ms.
Product exploration explored 100000 steps with 5431 reset in 372 ms.
Built C files in :
/tmp/ltsmin16713442574881585605
[2025-05-31 22:52:37] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2025-05-31 22:52:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:52:37] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2025-05-31 22:52:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:52:37] [INFO ] Computing Do-Not-Accords matrix : 225 transitions.
[2025-05-31 22:52:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:52:37] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16713442574881585605
Running compilation step : cd /tmp/ltsmin16713442574881585605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 848 ms.
Running link step : cd /tmp/ltsmin16713442574881585605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16713442574881585605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15075641441031459905.hoa' '--buchi-type=spotba'
LTSmin run took 5201 ms.
FORMULA DES-PT-40b-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLCardinality-12 finished in 274173 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 7 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Graph (complete) has 910 edges and 403 vertex of which 397 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 396 transition count 330
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 381 transition count 330
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 381 transition count 320
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 371 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 366 transition count 315
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 366 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 366 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 65 place count 366 transition count 309
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 364 transition count 309
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 363 transition count 308
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 363 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 363 transition count 307
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 220 place count 289 transition count 233
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 228 place count 285 transition count 242
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 285 transition count 242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 283 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 282 transition count 240
Applied a total of 232 rules in 55 ms. Remains 282 /403 variables (removed 121) and now considering 240/349 (removed 109) transitions.
// Phase 1: matrix 240 rows 282 cols
[2025-05-31 22:52:43] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:52:43] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-05-31 22:52:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:52:44] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:52:44] [INFO ] Redundant transitions in 2 ms returned []
Running 236 sub problems to find dead transitions.
[2025-05-31 22:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 2/281 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 240/521 variables, 281/339 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:53:02] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:53:05] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:53:13] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/522 variables, and 342 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/282 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 1/279 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 2/281 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 240/521 variables, 281/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 236/578 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/522 variables, and 578 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/282 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/403 places, 240/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61346 ms. Remains : 282/403 places, 240/349 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-13
Product exploration explored 100000 steps with 5031 reset in 300 ms.
Product exploration explored 100000 steps with 4999 reset in 339 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Graph (complete) has 912 edges and 282 vertex of which 280 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 2478 steps (117 resets) in 19 ms. (123 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 282 /282 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-05-31 22:53:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:53:46] [INFO ] Implicit Places using invariants in 498 ms returned []
[2025-05-31 22:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:53:47] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:53:47] [INFO ] Redundant transitions in 2 ms returned []
Running 236 sub problems to find dead transitions.
[2025-05-31 22:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 2/281 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 240/521 variables, 281/339 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:54:14] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/522 variables, and 342 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/282 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 1/279 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 2/281 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 240/521 variables, 281/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 236/578 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/522 variables, and 578 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/282 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61502 ms. Remains : 282/282 places, 240/240 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Graph (complete) has 912 edges and 282 vertex of which 280 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 1212 steps (56 resets) in 11 ms. (101 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4970 reset in 466 ms.
Product exploration explored 100000 steps with 5003 reset in 373 ms.
Built C files in :
/tmp/ltsmin6707179648008593519
[2025-05-31 22:54:48] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-05-31 22:54:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:54:48] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-05-31 22:54:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:54:48] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-05-31 22:54:48] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 22:54:48] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6707179648008593519
Running compilation step : cd /tmp/ltsmin6707179648008593519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 785 ms.
Running link step : cd /tmp/ltsmin6707179648008593519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6707179648008593519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5091431810863629003.hoa' '--buchi-type=spotba'
LTSmin run took 2862 ms.
FORMULA DES-PT-40b-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLCardinality-13 finished in 128755 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((G(p0)&&X(F(p1)))))'
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 395 transition count 341
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 395 transition count 341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 395 transition count 337
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 393 transition count 335
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 393 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 393 transition count 333
Applied a total of 26 rules in 38 ms. Remains 393 /403 variables (removed 10) and now considering 333/349 (removed 16) transitions.
// Phase 1: matrix 333 rows 393 cols
[2025-05-31 22:54:52] [INFO ] Computed 62 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:54:52] [INFO ] Implicit Places using invariants in 450 ms returned []
[2025-05-31 22:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:54:54] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2461 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-05-31 22:54:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:06] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:07] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:08] [INFO ] Deduced a trap composed of 8 places in 373 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:08] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:09] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:09] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:09] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:10] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:10] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:10] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:11] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:11] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:11] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:11] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:12] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:12] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:12] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:13] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:17] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:17] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 39 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:21] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:21] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:21] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:21] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:21] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:22] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:22] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 482 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:30] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:30] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:31] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:31] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:31] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:31] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:31] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:31] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:31] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:31] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:31] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:32] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:32] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:32] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:32] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:33] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:33] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:33] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:33] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:33] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:34] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:34] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:34] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:34] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:55:35] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 333/726 variables, 393/508 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 332/840 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 840 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 393/403 places, 333/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62633 ms. Remains : 393/403 places, 333/349 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-40b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-14 finished in 62879 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((X(X(X(X(X(X(F(p1)))))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DES-PT-40b-LTLCardinality-10
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 403/403 places, 349/349 transitions.
Graph (complete) has 910 edges and 403 vertex of which 396 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 395 transition count 329
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 380 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 380 transition count 319
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 370 transition count 319
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 364 transition count 313
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 364 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 364 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 364 transition count 308
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 363 transition count 308
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 361 transition count 306
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 361 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 361 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 75 place count 361 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 360 transition count 303
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 231 place count 283 transition count 226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 235 place count 281 transition count 228
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 279 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 238 place count 278 transition count 226
Applied a total of 238 rules in 92 ms. Remains 278 /403 variables (removed 125) and now considering 226/349 (removed 123) transitions.
// Phase 1: matrix 226 rows 278 cols
[2025-05-31 22:55:55] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:55:56] [INFO ] Implicit Places using invariants in 448 ms returned []
[2025-05-31 22:55:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:55:57] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-05-31 22:55:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 226/503 variables, 277/335 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:56:11] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:56:18] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:56:18] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:56:18] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:56:19] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/504 variables, and 340 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/278 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 226/503 variables, 277/340 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 223/563 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/504 variables, and 563 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/278 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LI_LTL mode, iteration 1 : 278/403 places, 226/349 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61510 ms. Remains : 278/403 places, 226/349 transitions.
Running random walk in product with property : DES-PT-40b-LTLCardinality-10
Product exploration explored 100000 steps with 4869 reset in 232 ms.
Product exploration explored 100000 steps with 4916 reset in 271 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1962 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (297 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1093635 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1093635 steps, saw 146192 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
[2025-05-31 22:57:01] [INFO ] Invariant cache hit.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/189 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/218 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/225 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 181/406 variables, 225/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/420 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/464 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/464 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/504 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/189 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/218 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/225 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 181/406 variables, 225/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/420 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/464 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:57:02] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 12 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/464 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/464 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 40/504 variables, 40/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/504 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/504 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1543ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 226/226 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 278 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 277 transition count 224
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 277 transition count 224
Applied a total of 4 rules in 33 ms. Remains 277 /278 variables (removed 1) and now considering 224/226 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 277/278 places, 224/226 transitions.
RANDOM walk for 40000 steps (1890 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (277 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1038429 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 1
Probabilistic random walk after 1038429 steps, saw 139596 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
// Phase 1: matrix 224 rows 277 cols
[2025-05-31 22:57:05] [INFO ] Computed 59 invariants in 4 ms
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/218 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/225 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/418 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/462 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 39/501 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/501 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/501 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:57:06] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/218 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/225 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 179/404 variables, 225/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/418 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 44/462 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/462 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 39/501 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/501 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:57:06] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 10 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/501 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/501 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/501 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 224/224 transitions.
Applied a total of 0 rules in 10 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 277/277 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 224/224 transitions.
Applied a total of 0 rules in 9 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2025-05-31 22:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:57:07] [INFO ] Implicit Places using invariants in 494 ms returned []
[2025-05-31 22:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:57:08] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:57:08] [INFO ] Redundant transitions in 2 ms returned []
Running 221 sub problems to find dead transitions.
[2025-05-31 22:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 2/276 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 224/500 variables, 276/335 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:57:19] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:57:21] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:57:28] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 221 unsolved
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 30103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31475 ms. Remains : 277/277 places, 224/224 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 224
Applied a total of 1 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 277 cols
[2025-05-31 22:57:38] [INFO ] Computed 59 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:57:38] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:57:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 22:57:38] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-31 22:57:39] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 22:57:39] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 22:57:39] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 437 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 226/226 transitions.
Applied a total of 0 rules in 6 ms. Remains 278 /278 variables (removed 0) and now considering 226/226 (removed 0) transitions.
// Phase 1: matrix 226 rows 278 cols
[2025-05-31 22:57:39] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:57:40] [INFO ] Implicit Places using invariants in 474 ms returned []
[2025-05-31 22:57:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:57:40] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-05-31 22:57:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 226/503 variables, 277/335 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:57:53] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:58:01] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:58:01] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:58:02] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:58:03] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/504 variables, and 340 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/278 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 226/503 variables, 277/340 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 223/563 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/504 variables, and 563 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/278 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in LTL mode , in 1 iterations and 61379 ms. Remains : 278/278 places, 226/226 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1943 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (295 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1044790 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1044790 steps, saw 140436 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
[2025-05-31 22:58:44] [INFO ] Invariant cache hit.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/189 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/218 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/225 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 181/406 variables, 225/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/420 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/464 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/464 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/504 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/189 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/218 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/225 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 181/406 variables, 225/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/420 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/464 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:58:45] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 11 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/464 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/464 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 40/504 variables, 40/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/504 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/504 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1536ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 226/226 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 278 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 277 transition count 224
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 277 transition count 224
Applied a total of 4 rules in 33 ms. Remains 277 /278 variables (removed 1) and now considering 224/226 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 277/278 places, 224/226 transitions.
RANDOM walk for 40000 steps (1895 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (304 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1014987 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 1
Probabilistic random walk after 1014987 steps, saw 136640 distinct states, run finished after 3004 ms. (steps per millisecond=337 ) properties seen :0
// Phase 1: matrix 224 rows 277 cols
[2025-05-31 22:58:49] [INFO ] Computed 59 invariants in 2 ms
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/218 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/225 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/418 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/462 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 39/501 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/501 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/501 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:58:49] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/218 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/225 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 179/404 variables, 225/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/418 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 44/462 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/462 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 39/501 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/501 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:58:50] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 10 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/501 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/501 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/501 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1325ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 224/224 transitions.
Applied a total of 0 rules in 9 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 277/277 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 224/224 transitions.
Applied a total of 0 rules in 9 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2025-05-31 22:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:58:50] [INFO ] Implicit Places using invariants in 472 ms returned []
[2025-05-31 22:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:58:51] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:58:51] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2025-05-31 22:58:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 2/276 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 224/500 variables, 276/335 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:59:02] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:59:04] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:59:11] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/501 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 339 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 2/276 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 224/500 variables, 276/338 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 221/559 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/501 variables, and 559 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61385 ms. Remains : 277/277 places, 224/224 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 224
Applied a total of 1 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 277 cols
[2025-05-31 22:59:51] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:59:51] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 22:59:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 22:59:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2025-05-31 22:59:52] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 22:59:52] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 22:59:52] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 465 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4891 reset in 392 ms.
Product exploration explored 100000 steps with 4850 reset in 438 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 226/226 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:59:54] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
// Phase 1: matrix 226 rows 278 cols
[2025-05-31 22:59:54] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 226/503 variables, 277/335 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:00:07] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:00:07] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:00:07] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/504 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/504 variables, and 339 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 226/503 variables, 277/338 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 223/561 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/504 variables, and 561 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/278 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60099 ms. Remains : 278/278 places, 226/226 transitions.
Built C files in :
/tmp/ltsmin15891921354731732290
[2025-05-31 23:00:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15891921354731732290
Running compilation step : cd /tmp/ltsmin15891921354731732290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 801 ms.
Running link step : cd /tmp/ltsmin15891921354731732290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15891921354731732290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5393846132900706777.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 226/226 transitions.
Applied a total of 0 rules in 6 ms. Remains 278 /278 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2025-05-31 23:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 23:01:09] [INFO ] Implicit Places using invariants in 465 ms returned []
[2025-05-31 23:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 23:01:10] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-05-31 23:01:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 226/503 variables, 277/335 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:01:24] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:01:31] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:01:31] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:01:31] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:01:32] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 223 unsolved
SMT process timed out in 30095ms, After SMT, problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 30096ms
Finished structural reductions in LTL mode , in 1 iterations and 31437 ms. Remains : 278/278 places, 226/226 transitions.
Built C files in :
/tmp/ltsmin6700890374451375709
[2025-05-31 23:01:40] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6700890374451375709
Running compilation step : cd /tmp/ltsmin6700890374451375709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 813 ms.
Running link step : cd /tmp/ltsmin6700890374451375709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6700890374451375709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11928936621132507443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 23:01:55] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:01:55] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:01:55] [INFO ] Time to serialize gal into /tmp/LTL1427565075175534129.gal : 3 ms
[2025-05-31 23:01:55] [INFO ] Time to serialize properties into /tmp/LTL4902343599422161216.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/LTL1427565075175534129.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16300980064426373704.hoa' '-atoms' '/tmp/LTL4902343599422161216.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/LTL4902343599422161216.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16300980064426373704.hoa
Detected timeout of ITS tools.
[2025-05-31 23:02:10] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:02:10] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:02:10] [INFO ] Time to serialize gal into /tmp/LTL16049950808842727423.gal : 2 ms
[2025-05-31 23:02:10] [INFO ] Time to serialize properties into /tmp/LTL15063958075627137309.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/LTL16049950808842727423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15063958075627137309.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 : !((X(X(G("((p40==0)||(p221==1))")))))
Formula 0 simplified : XXF!"((p40==0)||(p221==1))"
Detected timeout of ITS tools.
[2025-05-31 23:02:26] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:02:26] [INFO ] Applying decomposition
[2025-05-31 23:02:26] [INFO ] Flatten gal took : 11 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/graph12250885894302549671.txt' '-o' '/tmp/graph12250885894302549671.bin' '-w' '/tmp/graph12250885894302549671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12250885894302549671.bin' '-l' '-1' '-v' '-w' '/tmp/graph12250885894302549671.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:02:26] [INFO ] Decomposing Gal with order
[2025-05-31 23:02:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:02:26] [INFO ] Removed a total of 76 redundant transitions.
[2025-05-31 23:02:26] [INFO ] Flatten gal took : 24 ms
[2025-05-31 23:02:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 13 ms.
[2025-05-31 23:02:26] [INFO ] Time to serialize gal into /tmp/LTL9809678487370666315.gal : 4 ms
[2025-05-31 23:02:26] [INFO ] Time to serialize properties into /tmp/LTL15183441185718104465.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/LTL9809678487370666315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15183441185718104465.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 : !((X(X(G("((i4.u12.p40==0)||(i0.i1.u5.p221==1))")))))
Formula 0 simplified : XXF!"((i4.u12.p40==0)||(i0.i1.u5.p221==1))"
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLCardinality-10 finished in 405813 ms.
[2025-05-31 23:02:41] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2571242779336905992
[2025-05-31 23:02:41] [INFO ] Computing symmetric may disable matrix : 349 transitions.
[2025-05-31 23:02:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 23:02:41] [INFO ] Computing symmetric may enable matrix : 349 transitions.
[2025-05-31 23:02:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 23:02:41] [INFO ] Applying decomposition
[2025-05-31 23:02:41] [INFO ] Flatten gal took : 13 ms
[2025-05-31 23:02:41] [INFO ] Computing Do-Not-Accords matrix : 349 transitions.
[2025-05-31 23:02:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph664578900448231697.txt' '-o' '/tmp/graph664578900448231697.bin' '-w' '/tmp/graph664578900448231697.weights'
[2025-05-31 23:02:41] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2571242779336905992
Running compilation step : cd /tmp/ltsmin2571242779336905992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph664578900448231697.bin' '-l' '-1' '-v' '-w' '/tmp/graph664578900448231697.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:02:41] [INFO ] Decomposing Gal with order
[2025-05-31 23:02:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:02:41] [INFO ] Removed a total of 26 redundant transitions.
[2025-05-31 23:02:41] [INFO ] Flatten gal took : 27 ms
[2025-05-31 23:02:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 5 ms.
[2025-05-31 23:02:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality5741478169415158753.gal : 5 ms
[2025-05-31 23:02:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality2889699749122486081.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/LTLCardinality5741478169415158753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2889699749122486081.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G(("((i7.u40.p308==0)||(i6.i0.i1.u63.p373==1))")||(X(X(X(X(X(X(F("((i2.u9.p134==0)||(i1.u29.p279==1))"))))))))))))
Formula 0 simplified : G(F!"((i7.u40.p308==0)||(i6.i0.i1.u63.p373==1))" & FG!"((i2.u9.p134==0)||(i1.u29.p279==1))")
Compilation finished in 1212 ms.
Running link step : cd /tmp/ltsmin2571242779336905992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2571242779336905992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(X(X(X(X(X(<>((LTLAPp1==true))))))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t54, t257, t309, t310, t342, u32.t79, i1.t340, i1.t88, i1.u19.t99, i1.u21.t93, i1.u2...1198
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2571242779336905992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(X(X(X(X(X(<>((LTLAPp1==true))))))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2571242779336905992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp2==true))))' '--buchi-type=spotba'
Computing Next relation with stutter on 1.05165e+09 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="DES-PT-40b"
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 DES-PT-40b, 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-174854064000339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 ;