About the Execution of ITS-Tools for QuasiCertifProtocol-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 692942.00 | 0.00 | 0.00 | FFTFTTTFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254700796.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 QuasiCertifProtocol-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254700796
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 27K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 216K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 298K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 149K 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 QuasiCertifProtocol-PT-10-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749142042738
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 16:47:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 16:47:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 16:47:24] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-06-05 16:47:24] [INFO ] Transformed 550 places.
[2025-06-05 16:47:24] [INFO ] Transformed 176 transitions.
[2025-06-05 16:47:24] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 352 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 29 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2025-06-05 16:47:24] [INFO ] Computed 350 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:24] [INFO ] Implicit Places using invariants in 471 ms returned []
[2025-06-05 16:47:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:25] [INFO ] Implicit Places using invariants and state equation in 443 ms returned [303, 304, 311, 312, 313, 314, 315, 316, 317, 318, 355]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 950 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/550 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1022 ms. Remains : 513/550 places, 176/176 transitions.
Support contains 352 out of 513 places after structural reductions.
[2025-06-05 16:47:25] [INFO ] Flatten gal took : 55 ms
[2025-06-05 16:47:25] [INFO ] Flatten gal took : 43 ms
[2025-06-05 16:47:25] [INFO ] Input system was already deterministic with 176 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (2771 resets) in 1998 ms. (20 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 193 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (32 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (22 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (33 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (26 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 16:47:26] [INFO ] Computed 340 invariants in 37 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 152/491 variables, 140/340 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 4 (OVERLAPS) 175/666 variables, 491/831 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 0/831 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 23/689 variables, 22/853 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 2 solved, 13 unsolved in 2947 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 15/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 100/100 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 128/326 variables, 107/207 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/207 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 123/449 variables, 123/330 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 164/613 variables, 449/779 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 8/787 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 0/787 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 65/678 variables, 53/840 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 2/842 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/678 variables, 0/842 constraints. Problems are: Problem set: 2 solved, 13 unsolved
SMT process timed out in 8075ms, After SMT, problems are : Problem set: 2 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 198 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 176/176 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 513 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 174
Applied a total of 2 rules in 40 ms. Remains 512 /513 variables (removed 1) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 512/513 places, 174/176 transitions.
RANDOM walk for 40000 steps (2900 resets) in 791 ms. (50 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (233 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (205 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (229 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (227 resets) in 209 ms. (190 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (204 resets) in 243 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (208 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (227 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (228 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (228 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (206 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (203 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
// Phase 1: matrix 174 rows 512 cols
[2025-06-05 16:47:35] [INFO ] Computed 341 invariants in 21 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 129/324 variables, 107/207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 123/447 variables, 123/330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 161/608 variables, 447/777 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 55/663 variables, 42/819 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 23/686 variables, 23/842 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 11/853 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/686 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 853 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2618 ms.
Refiners :[Generalized P Invariants (flows): 341/341 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 129/324 variables, 107/207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 123/447 variables, 123/330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 161/608 variables, 447/777 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 7/784 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 55/663 variables, 42/826 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 1/827 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 23/686 variables, 23/850 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 11/861 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/686 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 686/686 variables, and 861 constraints, problems are : Problem set: 0 solved, 11 unsolved in 12996 ms.
Refiners :[Generalized P Invariants (flows): 341/341 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15671ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Finished Parikh walk after 82 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=41 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 181 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(F(p0))))))'
Support contains 12 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 16:47:51] [INFO ] Computed 340 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:51] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-05 16:47:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:52] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:47:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19172 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 49263ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49265ms
Finished structural reductions in LTL mode , in 1 iterations and 50474 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 255 ms.
Product exploration explored 100000 steps with 25000 reset in 199 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-02 finished in 51417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F((p0||G(p1))))))'
Support contains 13 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 16:48:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:48:43] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-06-05 16:48:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:48:44] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:48: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/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19168 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 49230ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49232ms
Finished structural reductions in LTL mode , in 1 iterations and 50311 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-03 finished in 50509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((X(G(p0))||((!p1 U (p2||G(!p1))) U ((G(p3)&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))))))'
Support contains 146 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 16:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:49:33] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-06-05 16:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:49:34] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:49: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/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19040 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 49108ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49110ms
Finished structural reductions in LTL mode , in 1 iterations and 49935 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 353 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-05
Product exploration explored 100000 steps with 7557 reset in 786 ms.
Product exploration explored 100000 steps with 7541 reset in 700 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X p2), (X p3), (X (NOT (AND (NOT p2) p1 p3 (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (AND p2 p3))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1 p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p3)))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G p3))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p2 p3 (NOT p0))), (X (NOT (AND p2 p3 (NOT p0)))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (OR (NOT p3) (NOT p0)))), (X (X (NOT (OR (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 28 factoid took 595 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 7 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2)))]
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (2769 resets) in 910 ms. (43 steps per ms) remains 14/16 properties
BEST_FIRST walk for 40004 steps (239 resets) in 696 ms. (57 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (318 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (321 resets) in 491 ms. (81 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (241 resets) in 774 ms. (51 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (406 resets) in 605 ms. (66 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (180 resets) in 309 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (240 resets) in 297 ms. (134 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (242 resets) in 316 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (326 resets) in 340 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (179 resets) in 322 ms. (123 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (242 resets) in 294 ms. (135 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (323 resets) in 456 ms. (87 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (314 resets) in 171 ms. (232 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (325 resets) in 579 ms. (68 steps per ms) remains 14/14 properties
[2025-06-05 16:50:28] [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/146 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 138/284 variables, 146/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 4 (OVERLAPS) 394/678 variables, 356/602 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 230/832 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 0/832 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 11/689 variables, 10/842 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 11/853 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 3 solved, 11 unsolved in 2207 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 14/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 100/100 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/100 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 138/284 variables, 146/246 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/246 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 394/678 variables, 356/602 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 230/832 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 1/833 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 0/833 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 11/689 variables, 10/843 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 11/854 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/854 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/689 variables, 0/854 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 854 constraints, problems are : Problem set: 3 solved, 11 unsolved in 3179 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 11/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5444ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 3 different solutions.
Finished Parikh walk after 83 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 11 properties in 153 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X p2), (X p3), (X (NOT (AND (NOT p2) p1 p3 (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (AND p2 p3))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1 p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p3)))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G p3)), (G (OR (NOT p1) p2 p3)), (G (OR (NOT p0) (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) p1 p2 (NOT p3)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p2 p3 (NOT p0))), (X (NOT (AND p2 p3 (NOT p0)))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (OR (NOT p3) (NOT p0)))), (X (X (NOT (OR (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR p1 p2 (NOT p3)))), (F p0), (F p1), (F (NOT (AND (OR p0 (NOT p1) p2) (OR (NOT p1) p2 p3)))), (F (NOT (AND (OR p1 p2) (OR (NOT p2) p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT p2)), (F (NOT (AND p2 p3))), (F (NOT (AND (OR p0 p1 p2) (OR p1 p3) (OR (NOT p2) p3)))), (F (NOT p3)), (F (NOT (AND (OR p1 p3) (OR (NOT p2) p3))))]
Knowledge based reduction with 31 factoid took 1260 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 254 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Support contains 146 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 16:50:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:50:35] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-05 16:50:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:50:36] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:50: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/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19061 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 49123ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49124ms
Finished structural reductions in LTL mode , in 1 iterations and 49982 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p2 p3 (NOT p1)), (X (X p2)), (X (X p3)), (X (X (AND p2 p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 11 factoid took 184 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (2772 resets) in 572 ms. (69 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (244 resets) in 253 ms. (157 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (329 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (324 resets) in 254 ms. (156 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (236 resets) in 418 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (333 resets) in 366 ms. (109 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (319 resets) in 572 ms. (69 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (322 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
[2025-06-05 16:51: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/145 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 135/280 variables, 145/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 369/649 variables, 332/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 220/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 11/660 variables, 10/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 11/818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 26/686 variables, 23/841 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 10/851 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/689 variables, 2/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1927 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 7/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 135/280 variables, 145/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 369/649 variables, 332/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 220/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 11/660 variables, 10/808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 11/819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 26/686 variables, 23/842 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 10/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 3/689 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/689 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/689 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 854 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2832 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 7/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4775ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 83 steps, including 0 resets, run visited all 7 properties in 4 ms. (steps per millisecond=20 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) p2 p3 (NOT p1)), (X (X p2)), (X (X p3)), (X (X (AND p2 p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0), (F (NOT (AND p2 p3))), (F (NOT (AND (OR p1 p2) p3))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND (OR p1 p2) (OR (NOT p2) p3)))), (F (NOT (OR (NOT p0) (NOT p3)))), (F p1)]
Knowledge based reduction with 11 factoid took 515 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 281 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 7539 reset in 381 ms.
Product exploration explored 100000 steps with 7483 reset in 383 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 260 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Support contains 146 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.8 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 501 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 59 ms. Remains 501 /513 variables (removed 12) and now considering 175/176 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:51:34] [INFO ] Redundant transitions in 23 ms returned []
Running 163 sub problems to find dead transitions.
// Phase 1: matrix 175 rows 501 cols
[2025-06-05 16:51:34] [INFO ] Computed 330 invariants in 23 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Problem TDEAD48 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 2 (OVERLAPS) 175/675 variables, 500/830 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/675 variables, 0/830 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 1/676 variables, 1/831 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 0/831 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/676 variables, 0/831 constraints. Problems are: Problem set: 2 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 831 constraints, problems are : Problem set: 2 solved, 161 unsolved in 18394 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 330/330 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 174/673 variables, 499/829 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 161/990 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 0/990 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 3/676 variables, 2/992 constraints. Problems are: Problem set: 2 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 992 constraints, problems are : Problem set: 2 solved, 161 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 161/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48480ms problems are : Problem set: 2 solved, 161 unsolved
Search for dead transitions found 2 dead transitions in 48481ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 501/513 places, 173/176 transitions.
Graph (complete) has 2126 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 500 /501 variables (removed 1) and now considering 173/173 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 500/513 places, 173/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48592 ms. Remains : 500/513 places, 173/176 transitions.
Built C files in :
/tmp/ltsmin10094711156989921899
[2025-06-05 16:52:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10094711156989921899
Running compilation step : cd /tmp/ltsmin10094711156989921899;'/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 572 ms.
Running link step : cd /tmp/ltsmin10094711156989921899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10094711156989921899;'/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/stateBased9328972184537828202.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 146 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 16:52:38] [INFO ] Computed 340 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:52:38] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-06-05 16:52:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:52:38] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:52:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 18865 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 48922ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 48924ms
Finished structural reductions in LTL mode , in 1 iterations and 49841 ms. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin6770084190951283466
[2025-06-05 16:53:27] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6770084190951283466
Running compilation step : cd /tmp/ltsmin6770084190951283466;'/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 465 ms.
Running link step : cd /tmp/ltsmin6770084190951283466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6770084190951283466;'/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/stateBased8341095000612539407.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:53:43] [INFO ] Flatten gal took : 22 ms
[2025-06-05 16:53:43] [INFO ] Flatten gal took : 21 ms
[2025-06-05 16:53:43] [INFO ] Time to serialize gal into /tmp/LTL17306319939703510140.gal : 19 ms
[2025-06-05 16:53:43] [INFO ] Time to serialize properties into /tmp/LTL17941361386339272598.prop : 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/LTL17306319939703510140.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2013917797567107068.hoa' '-atoms' '/tmp/LTL17941361386339272598.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17941361386339272598.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2013917797567107068.hoa
Detected timeout of ITS tools.
[2025-06-05 16:53:58] [INFO ] Flatten gal took : 36 ms
[2025-06-05 16:53:58] [INFO ] Flatten gal took : 37 ms
[2025-06-05 16:53:58] [INFO ] Time to serialize gal into /tmp/LTL16298608150486400276.gal : 5 ms
[2025-06-05 16:53:58] [INFO ] Time to serialize properties into /tmp/LTL4617440567587985047.ltl : 16 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/LTL16298608150486400276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4617440567587985047.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("(a1>=1)"))||(G((X(G("(a1>=1)")))||(((!("(((((((((c1_9>=1)&&(n9_2_9>=1))&&((n9_3_9>=1)&&(n9_0_9>=1)))&&(((n9_1_9>=1)&&(n9_9_9>=1...19344
Formula 0 simplified : X!"(a1>=1)" & F(XF!"(a1>=1)" & (("(((((((((c1_9>=1)&&(n9_2_9>=1))&&((n9_3_9>=1)&&(n9_0_9>=1)))&&(((n9_1_9>=1)&&(n9_9_9>=1))&&((n9_8_...13347
Detected timeout of ITS tools.
[2025-06-05 16:54:13] [INFO ] Flatten gal took : 21 ms
[2025-06-05 16:54:13] [INFO ] Applying decomposition
[2025-06-05 16:54:13] [INFO ] Flatten gal took : 18 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/graph17210260326075270361.txt' '-o' '/tmp/graph17210260326075270361.bin' '-w' '/tmp/graph17210260326075270361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17210260326075270361.bin' '-l' '-1' '-v' '-w' '/tmp/graph17210260326075270361.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:54:13] [INFO ] Decomposing Gal with order
[2025-06-05 16:54:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:54:13] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-05 16:54:13] [INFO ] Flatten gal took : 90 ms
[2025-06-05 16:54:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 19 ms.
[2025-06-05 16:54:13] [INFO ] Time to serialize gal into /tmp/LTL17370810619137694132.gal : 8 ms
[2025-06-05 16:54:13] [INFO ] Time to serialize properties into /tmp/LTL9183045003630781809.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17370810619137694132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9183045003630781809.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("(i12.i0.u32.a1>=1)"))||(G((X(G("(i12.i0.u32.a1>=1)")))||(((!("(((((((((i10.i0.u17.c1_9>=1)&&(u4.n9_2_9>=1))&&((u3.n9_3_9>=1)&&(...24237
Formula 0 simplified : X!"(i12.i0.u32.a1>=1)" & F(XF!"(i12.i0.u32.a1>=1)" & (("(((((((((i10.i0.u17.c1_9>=1)&&(u4.n9_2_9>=1))&&((u3.n9_3_9>=1)&&(u2.n9_0_9>=...16761
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-05 finished in 295400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((F(!p1)&&X(X(F(p2))))))))'
Support contains 15 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 16:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:54:29] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-06-05 16:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:54:30] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:54:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19629 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 49687ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49687ms
Finished structural reductions in LTL mode , in 1 iterations and 50900 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), p1, (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-08
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-08 finished in 51171 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||X(F(p1)))))'
Support contains 14 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
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 3 place count 500 transition count 173
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 500 transition count 173
Applied a total of 4 rules in 40 ms. Remains 500 /513 variables (removed 13) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 500 cols
[2025-06-05 16:55:20] [INFO ] Computed 330 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:20] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-06-05 16:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:21] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:55:21] [INFO ] Redundant transitions in 24 ms returned []
Running 161 sub problems to find dead transitions.
[2025-06-05 16:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 173/672 variables, 499/829 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 1/673 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/673 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 830 constraints, problems are : Problem set: 0 solved, 161 unsolved in 18482 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 173/672 variables, 499/829 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 161/990 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 1/673 variables, 1/991 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/673 variables, and 991 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48542ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 48543ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/513 places, 173/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49830 ms. Remains : 500/513 places, 173/176 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-09
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-09 finished in 49939 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) U (!p1&&X(p2)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 16:56:10] [INFO ] Computed 340 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:56:10] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-06-05 16:56:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:56:11] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:56: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/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19263 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 49322ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49323ms
Finished structural reductions in LTL mode , in 1 iterations and 50634 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-11
Stuttering criterion allowed to conclude after 49111 steps with 9609 reset in 130 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-11 finished in 51042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (X(F(p2))&&p1))))'
Support contains 14 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 16:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:57:01] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-06-05 16:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:57:02] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:57:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19088 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 49140ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49140ms
Finished structural reductions in LTL mode , in 1 iterations and 50221 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-12
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-12 finished in 50432 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||F(p1)))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 0 with 4 rules applied. Total rules applied 5 place count 498 transition count 171
Applied a total of 5 rules in 21 ms. Remains 498 /513 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 498 cols
[2025-06-05 16:57:51] [INFO ] Computed 330 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:57:51] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-06-05 16:57:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:57:52] [INFO ] Implicit Places using invariants and state equation in 624 ms returned [417, 418, 419, 420, 421, 422, 474, 477, 478, 479, 480]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 990 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/513 places, 171/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1023 ms. Remains : 487/513 places, 171/176 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-13 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((X(G(p0))||((!p1 U (p2||G(!p1))) U ((G(p3)&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))))))'
[2025-06-05 16:57:52] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11230521724036825571
[2025-06-05 16:57:52] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-06-05 16:57:52] [INFO ] Applying decomposition
[2025-06-05 16:57:52] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:57:52] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-06-05 16:57:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:57:52] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-06-05 16:57:52] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:57:52] [INFO ] Flatten gal took : 42 ms
[2025-06-05 16:57:52] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11230521724036825571
Running compilation step : cd /tmp/ltsmin11230521724036825571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph10040412204600715566.txt' '-o' '/tmp/graph10040412204600715566.bin' '-w' '/tmp/graph10040412204600715566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10040412204600715566.bin' '-l' '-1' '-v' '-w' '/tmp/graph10040412204600715566.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:57:52] [INFO ] Decomposing Gal with order
[2025-06-05 16:57:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:57:52] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-05 16:57:53] [INFO ] Flatten gal took : 85 ms
[2025-06-05 16:57:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 29 ms.
[2025-06-05 16:57:53] [INFO ] Time to serialize gal into /tmp/LTLFireability2919412231086565216.gal : 5 ms
[2025-06-05 16:57:53] [INFO ] Time to serialize properties into /tmp/LTLFireability1813529940300367669.ltl : 19 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/LTLFireability2919412231086565216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1813529940300367669.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 1 LTL properties
Checking formula 0 : !(((X("(i9.u50.a1>=1)"))||(G((X(G("(i9.u50.a1>=1)")))||(((!("(((((((((i17.i1.u17.c1_9>=1)&&(u4.n9_2_9>=1))&&((u3.n9_3_9>=1)&&(u2.n9_0_...24189
Formula 0 simplified : X!"(i9.u50.a1>=1)" & F(XF!"(i9.u50.a1>=1)" & (("(((((((((i17.i1.u17.c1_9>=1)&&(u4.n9_2_9>=1))&&((u3.n9_3_9>=1)&&(u2.n9_0_9>=1)))&&((...16722
Compilation finished in 544 ms.
Running link step : cd /tmp/ltsmin11230521724036825571;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11230521724036825571;'/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((LTLAPp0==true))||[]((X([]((LTLAPp0==true)))||((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))) U (([]((LTLAPp3==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))||[]((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))))))' '--buchi-type=spotba'
LTSmin run took 61788 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 691299 ms.
BK_STOP 1749142735680
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254700796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;