About the Execution of ITS-Tools for QuasiCertifProtocol-COL-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ??TFFFT?TTF?F?FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254600771.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-COL-32, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254600771
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 131K 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-COL-32-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749138002055
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-05 15:40:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 15:40:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:40:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-05 15:40:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 15:40:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2025-06-05 15:40:03] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 15:40:04] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2025-06-05 15:40:04] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40038 steps (907 resets) in 761 ms. (52 steps per ms) remains 4/33 properties
BEST_FIRST walk for 40007 steps (296 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (295 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (294 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (296 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
// Phase 1: matrix 26 rows 30 cols
[2025-06-05 15:40:04] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/34 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 15/49 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/54 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/56 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 4 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/34 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 15/49 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/54 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/54 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/56 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 39 constraints, problems are : Problem set: 0 solved, 4 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 210 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=105 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 16 ms.
[2025-06-05 15:40:05] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:40:05] [INFO ] Flatten gal took : 5 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2025-06-05 15:40:05] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 53 ms.
[2025-06-05 15:40:05] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Support contains 2616 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 3773 transition count 506
Applied a total of 33 rules in 143 ms. Remains 3773 /3806 variables (removed 33) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3773 cols
[2025-06-05 15:40:05] [INFO ] Computed 3268 invariants in 146 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:40:08] [INFO ] Implicit Places using invariants in 2924 ms returned []
[2025-06-05 15:40:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:40:19] [INFO ] Implicit Places using invariants and state equation in 11050 ms returned []
Implicit Place search using SMT with State Equation took 14002 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:40:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 2208/2208 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 timeout
1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4279 variables, and 2208 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/36 constraints, Generalized P Invariants (flows): 2208/3232 constraints, State Equation: 0/3773 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 2208/2208 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3735/4279 variables, and 2208 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/36 constraints, Generalized P Invariants (flows): 2208/3232 constraints, State Equation: 0/3773 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60788ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60800ms
Starting structural reductions in LTL mode, iteration 1 : 3773/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74964 ms. Remains : 3773/3806 places, 506/506 transitions.
Support contains 2616 out of 3773 places after structural reductions.
[2025-06-05 15:41:20] [INFO ] Flatten gal took : 223 ms
[2025-06-05 15:41:20] [INFO ] Flatten gal took : 118 ms
[2025-06-05 15:41:21] [INFO ] Input system was already deterministic with 506 transitions.
RANDOM walk for 40000 steps (1070 resets) in 5783 ms. (6 steps per ms) remains 21/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 21/21 properties
[2025-06-05 15:41:23] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2515 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2515 variables, 2112/2113 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2515 variables, 0/2113 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 102/2617 variables, 35/2148 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2617 variables, 0/2148 constraints. Problems are: Problem set: 0 solved, 21 unsolved
SMT process timed out in 5102ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2515 out of 3773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Graph (complete) has 43441 edges and 3773 vertex of which 3772 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3771 transition count 505
Applied a total of 2 rules in 272 ms. Remains 3771 /3773 variables (removed 2) and now considering 505/506 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 3771/3773 places, 505/506 transitions.
RANDOM walk for 40000 steps (983 resets) in 5270 ms. (7 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 21/21 properties
Finished probabilistic random walk after 114885 steps, run visited all 21 properties in 1918 ms. (steps per millisecond=59 )
Probabilistic random walk after 114885 steps, saw 34404 distinct states, run finished after 1925 ms. (steps per millisecond=59 ) properties seen :21
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3773 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3773 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(((G(F(p0))||(F(p0)&&G(F(p1)))) U X(X(X(p2))))))'
Support contains 35 out of 3773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 3738 transition count 506
Applied a total of 35 rules in 492 ms. Remains 3738 /3773 variables (removed 35) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3738 cols
[2025-06-05 15:41:33] [INFO ] Computed 3234 invariants in 117 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:41:39] [INFO ] Implicit Places using invariants in 6388 ms returned []
[2025-06-05 15:41:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:41:57] [INFO ] Implicit Places using invariants and state equation in 17976 ms returned [3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532, 3533]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 24378 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3705/3773 places, 506/506 transitions.
Applied a total of 0 rules in 250 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25120 ms. Remains : 3705/3773 places, 506/506 transitions.
Stuttering acceptance computed with spot in 603 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-00
Product exploration explored 100000 steps with 17464 reset in 550 ms.
Product exploration explored 100000 steps with 17426 reset in 523 ms.
Computed a total of 3705 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3705 transition count 506
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 p0 (NOT p2) (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 285 ms. Reduced automaton from 13 states, 21 edges and 3 AP (stutter sensitive) to 13 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1068 resets) in 185 ms. (215 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (41 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
// Phase 1: matrix 506 rows 3705 cols
[2025-06-05 15:42:01] [INFO ] Computed 3201 invariants in 84 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 264/300 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 497/797 variables, 264/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3408/4205 variables, 3402/3735 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4205 variables, 3168/6903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4205 variables, 0/6903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/4211 variables, 3/6906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4211 variables, 0/6906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4211 variables, 0/6906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4211/4211 variables, and 6906 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2878 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3705/3705 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 264/300 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 497/797 variables, 264/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 32/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/797 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/797 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3408/4205 variables, 3402/3738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4205/4211 variables, and 6906 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3702/3705 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8022ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 3705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Graph (complete) has 41158 edges and 3705 vertex of which 2582 are kept as prefixes of interest. Removing 1123 places using SCC suffix rule.7 ms
Discarding 1123 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 2582 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 2580 transition count 432
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 139 place count 2516 transition count 368
Iterating global reduction 2 with 64 rules applied. Total rules applied 203 place count 2516 transition count 368
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 2 with 34 rules applied. Total rules applied 237 place count 2516 transition count 334
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 271 place count 2482 transition count 334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 2481 transition count 333
Applied a total of 272 rules in 672 ms. Remains 2481 /3705 variables (removed 1224) and now considering 333/506 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 673 ms. Remains : 2481/3705 places, 333/506 transitions.
RANDOM walk for 40000 steps (1008 resets) in 507 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (25 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 337702 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :1 out of 4
Probabilistic random walk after 337702 steps, saw 80173 distinct states, run finished after 3003 ms. (steps per millisecond=112 ) properties seen :1
// Phase 1: matrix 333 rows 2481 cols
[2025-06-05 15:42:13] [INFO ] Computed 2148 invariants in 24 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 100/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:13] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:14] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 298/433 variables, 135/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2379/2812 variables, 2344/2511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2812 variables, 2080/4591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2812 variables, 0/4591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/2814 variables, 66/4657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2814 variables, 2/4659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2814 variables, 0/4659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2814 variables, 0/4659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2814/2814 variables, and 4659 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3645 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2146/2146 constraints, State Equation: 2481/2481 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 100/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:16] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 298/433 variables, 135/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2379/2812 variables, 2344/2513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/2812 variables, 2080/4593 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2812 variables, 0/4593 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2814 variables, 66/4659 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2814 variables, 2/4661 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2814 variables, 0/4661 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2814 variables, 0/4661 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2814/2814 variables, and 4661 constraints, problems are : Problem set: 2 solved, 1 unsolved in 19940 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2146/2146 constraints, State Equation: 2481/2481 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23647ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 134 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 3 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p2 p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 920 ms. Reduced automaton from 13 states, 21 edges and 3 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 395 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 422 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
// Phase 1: matrix 506 rows 3705 cols
[2025-06-05 15:42:38] [INFO ] Computed 3201 invariants in 76 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 15:42:39] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2025-06-05 15:42:51] [INFO ] [Real]Absence check using 1 positive and 3200 generalized place invariants in 11484 ms returned sat
[2025-06-05 15:42:53] [INFO ] [Real]Absence check using state equation in 2384 ms returned unknown
Could not prove EG (NOT p2)
Support contains 2 out of 3705 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 271 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 15:42:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:42:59] [INFO ] Implicit Places using invariants in 5922 ms returned []
[2025-06-05 15:42:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:43:28] [INFO ] Implicit Places using invariants and state equation in 28980 ms returned []
Implicit Place search using SMT with State Equation took 34905 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:43:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4211 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3705 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4211 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3705 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60493ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60507ms
Finished structural reductions in LTL mode , in 1 iterations and 95692 ms. Remains : 3705/3705 places, 506/506 transitions.
Computed a total of 3705 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3705 transition count 506
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 p0 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 11 states, 16 edges and 2 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
RANDOM walk for 40000 steps (1067 resets) in 223 ms. (178 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
[2025-06-05 15:44:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 231/234 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 495/729 variables, 231/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3471/4200 variables, 3465/3700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4200 variables, 3200/6900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4200 variables, 0/6900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/4211 variables, 6/6906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4211 variables, 0/6906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/4211 variables, 0/6906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4211/4211 variables, and 6906 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3705/3705 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 231/234 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 495/729 variables, 231/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3471/4200 variables, 3465/3702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4200 variables, 3200/6902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4200 variables, 0/6902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/4211 variables, 6/6908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4211/4211 variables, and 6908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3705/3705 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7169ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Graph (complete) has 41158 edges and 3705 vertex of which 2582 are kept as prefixes of interest. Removing 1123 places using SCC suffix rule.5 ms
Discarding 1123 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 2582 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 2580 transition count 432
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 139 place count 2516 transition count 368
Iterating global reduction 2 with 64 rules applied. Total rules applied 203 place count 2516 transition count 368
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 2 with 34 rules applied. Total rules applied 237 place count 2516 transition count 334
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 271 place count 2482 transition count 334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 2481 transition count 333
Applied a total of 272 rules in 675 ms. Remains 2481 /3705 variables (removed 1224) and now considering 333/506 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 2481/3705 places, 333/506 transitions.
RANDOM walk for 40000 steps (1006 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (25 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 377937 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :1 out of 2
Probabilistic random walk after 377937 steps, saw 86939 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :1
// Phase 1: matrix 333 rows 2481 cols
[2025-06-05 15:44:41] [INFO ] Computed 2148 invariants in 32 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:41] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:41] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:41] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:41] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:42] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:43] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/433 variables, 135/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2379/2812 variables, 2344/2512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2812 variables, 2080/4592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2812 variables, 0/4592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/2814 variables, 66/4658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2814 variables, 2/4660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2814 variables, 0/4660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2814 variables, 0/4660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2814/2814 variables, and 4660 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3262 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2146/2146 constraints, State Equation: 2481/2481 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:44] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/433 variables, 135/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2379/2812 variables, 2344/2514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2812 variables, 2080/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2812 variables, 0/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2814 variables, 66/4660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2814 variables, 2/4662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2814 variables, 0/4662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2814 variables, 0/4662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2814/2814 variables, and 4662 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2146/2146 constraints, State Equation: 2481/2481 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5231ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 111 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 11 states, 16 edges and 2 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 484 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 472 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
// Phase 1: matrix 506 rows 3705 cols
[2025-06-05 15:44:48] [INFO ] Computed 3201 invariants in 84 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 15:44:49] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-06-05 15:45:01] [INFO ] [Real]Absence check using 1 positive and 3200 generalized place invariants in 12165 ms returned sat
[2025-06-05 15:45:03] [INFO ] [Real]Absence check using state equation in 1645 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 385 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 19725 reset in 483 ms.
Product exploration explored 100000 steps with 19742 reset in 495 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 445 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Support contains 2 out of 3705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Graph (complete) has 41158 edges and 3705 vertex of which 3671 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.26 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3671 transition count 506
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 884 ms. Remains 3671 /3705 variables (removed 34) and now considering 506/506 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:45:06] [INFO ] Redundant transitions in 166 ms returned []
Running 472 sub problems to find dead transitions.
// Phase 1: matrix 506 rows 3671 cols
[2025-06-05 15:45:06] [INFO ] Computed 3169 invariants in 69 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3668 variables, 3168/3168 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3668/4177 variables, and 3168 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3168/3168 constraints, State Equation: 0/3671 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3668 variables, 3168/3168 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3668/4177 variables, and 3168 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3168/3168 constraints, State Equation: 0/3671 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60604ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60606ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3671/3705 places, 506/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61666 ms. Remains : 3671/3705 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin2035872880281105810
[2025-06-05 15:46:06] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2035872880281105810
Running compilation step : cd /tmp/ltsmin2035872880281105810;'/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 2438 ms.
Running link step : cd /tmp/ltsmin2035872880281105810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2035872880281105810;'/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/stateBased175002776981998638.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 339 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2025-06-05 15:46:22] [INFO ] Computed 3201 invariants in 77 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:46:28] [INFO ] Implicit Places using invariants in 6266 ms returned []
[2025-06-05 15:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:46:57] [INFO ] Implicit Places using invariants and state equation in 29333 ms returned []
Implicit Place search using SMT with State Equation took 35605 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:46:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4211 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3705 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4211 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3705 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60498ms
Finished structural reductions in LTL mode , in 1 iterations and 96446 ms. Remains : 3705/3705 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin4973190676885676510
[2025-06-05 15:47:58] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4973190676885676510
Running compilation step : cd /tmp/ltsmin4973190676885676510;'/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 2370 ms.
Running link step : cd /tmp/ltsmin4973190676885676510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4973190676885676510;'/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/stateBased16787672447208041818.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 15:48:14] [INFO ] Flatten gal took : 315 ms
[2025-06-05 15:48:14] [INFO ] Flatten gal took : 113 ms
[2025-06-05 15:48:14] [INFO ] Time to serialize gal into /tmp/LTL10748768105702942765.gal : 28 ms
[2025-06-05 15:48:14] [INFO ] Time to serialize properties into /tmp/LTL2545171554796694285.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10748768105702942765.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10017301453062173731.hoa' '-atoms' '/tmp/LTL2545171554796694285.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/LTL2545171554796694285.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10017301453062173731.hoa
Detected timeout of ITS tools.
[2025-06-05 15:48:29] [INFO ] Flatten gal took : 88 ms
[2025-06-05 15:48:29] [INFO ] Flatten gal took : 88 ms
[2025-06-05 15:48:29] [INFO ] Time to serialize gal into /tmp/LTL3788412276782034701.gal : 12 ms
[2025-06-05 15:48:29] [INFO ] Time to serialize properties into /tmp/LTL16323656017076777647.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3788412276782034701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16323656017076777647.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 : !((G(((G(F("(CstopAbort<2)")))||((F("(CstopAbort<2)"))&&(G(F("(((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sst...508
Formula 0 simplified : F((FG!"(CstopAbort<2)" & (G!"(CstopAbort<2)" | FG!"(((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sstart_6+Sst...489
Detected timeout of ITS tools.
[2025-06-05 15:48:44] [INFO ] Flatten gal took : 81 ms
[2025-06-05 15:48:44] [INFO ] Applying decomposition
[2025-06-05 15:48:44] [INFO ] Flatten gal took : 93 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/graph7265500587201865636.txt' '-o' '/tmp/graph7265500587201865636.bin' '-w' '/tmp/graph7265500587201865636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7265500587201865636.bin' '-l' '-1' '-v' '-w' '/tmp/graph7265500587201865636.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:48:45] [INFO ] Decomposing Gal with order
[2025-06-05 15:48:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:48:45] [INFO ] Removed a total of 99 redundant transitions.
[2025-06-05 15:48:45] [INFO ] Flatten gal took : 413 ms
[2025-06-05 15:48:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2025-06-05 15:48:46] [INFO ] Time to serialize gal into /tmp/LTL5720618145070520572.gal : 18 ms
[2025-06-05 15:48:46] [INFO ] Time to serialize properties into /tmp/LTL9024864011464723031.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5720618145070520572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9024864011464723031.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...275
Read 1 LTL properties
Checking formula 0 : !((G(((G(F("(gi0.gu0.CstopAbort<2)")))||((F("(gi0.gu0.CstopAbort<2)"))&&(G(F("(((((((gu100.Sstart_0+gu100.Sstart_1)+(gu100.Sstart_2+gu...730
Formula 0 simplified : F((FG!"(gi0.gu0.CstopAbort<2)" & (G!"(gi0.gu0.CstopAbort<2)" | FG!"(((((((gu100.Sstart_0+gu100.Sstart_1)+(gu100.Sstart_2+gu100.Sstar...711
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-00 finished in 448469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 33 out of 3773 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Graph (complete) has 43441 edges and 3773 vertex of which 1425 are kept as prefixes of interest. Removing 2348 places using SCC suffix rule.58 ms
Discarding 2348 places :
Also discarding 101 output transitions
Drop transitions (Output transitions of discarded places.) removed 101 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1424 transition count 306
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 1 with 4 rules applied. Total rules applied 103 place count 1422 transition count 304
Applied a total of 103 rules in 224 ms. Remains 1422 /3773 variables (removed 2351) and now considering 304/506 (removed 202) transitions.
// Phase 1: matrix 304 rows 1422 cols
[2025-06-05 15:49:01] [INFO ] Computed 1120 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:49:02] [INFO ] Implicit Places using invariants in 1364 ms returned []
[2025-06-05 15:49:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:49:04] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned [1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 3189 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1389/3773 places, 304/506 transitions.
Applied a total of 0 rules in 57 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3472 ms. Remains : 1389/3773 places, 304/506 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-01
Product exploration explored 100000 steps with 2441 reset in 708 ms.
Product exploration explored 100000 steps with 2442 reset in 596 ms.
Computed a total of 1389 stabilizing places and 304 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1389 transition count 304
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 40000 steps (898 resets) in 478 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6566 steps, run visited all 1 properties in 109 ms. (steps per millisecond=60 )
Probabilistic random walk after 6566 steps, saw 6404 distinct states, run finished after 109 ms. (steps per millisecond=60 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 33 out of 1389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1389/1389 places, 304/304 transitions.
Applied a total of 0 rules in 68 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
// Phase 1: matrix 304 rows 1389 cols
[2025-06-05 15:49:06] [INFO ] Computed 1088 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:49:08] [INFO ] Implicit Places using invariants in 1333 ms returned []
[2025-06-05 15:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:49:09] [INFO ] Implicit Places using invariants and state equation in 1746 ms returned []
Implicit Place search using SMT with State Equation took 3081 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:49:10] [INFO ] Redundant transitions in 40 ms returned []
Running 236 sub problems to find dead transitions.
[2025-06-05 15:49:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1356 variables, 1088/1088 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1356 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 304/1660 variables, 1356/2444 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1660 variables, 0/2444 constraints. Problems are: Problem set: 0 solved, 236 unsolved
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 30298ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33509 ms. Remains : 1389/1389 places, 304/304 transitions.
Computed a total of 1389 stabilizing places and 304 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1389 transition count 304
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (901 resets) in 364 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6566 steps, run visited all 1 properties in 73 ms. (steps per millisecond=89 )
Probabilistic random walk after 6566 steps, saw 6404 distinct states, run finished after 73 ms. (steps per millisecond=89 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2445 reset in 491 ms.
Product exploration explored 100000 steps with 2445 reset in 571 ms.
Built C files in :
/tmp/ltsmin7106608204839785541
[2025-06-05 15:49:42] [INFO ] Computing symmetric may disable matrix : 304 transitions.
[2025-06-05 15:49:42] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:49:42] [INFO ] Computing symmetric may enable matrix : 304 transitions.
[2025-06-05 15:49:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:49:42] [INFO ] Computing Do-Not-Accords matrix : 304 transitions.
[2025-06-05 15:49:42] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:49:42] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7106608204839785541
Running compilation step : cd /tmp/ltsmin7106608204839785541;'/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 1146 ms.
Running link step : cd /tmp/ltsmin7106608204839785541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7106608204839785541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5870500735667323603.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 1389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1389/1389 places, 304/304 transitions.
Applied a total of 0 rules in 63 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2025-06-05 15:49:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:49:58] [INFO ] Implicit Places using invariants in 1329 ms returned []
[2025-06-05 15:49:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:50:00] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 3089 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:50:00] [INFO ] Redundant transitions in 23 ms returned []
Running 236 sub problems to find dead transitions.
[2025-06-05 15:50:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1356 variables, 1088/1088 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1356 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 304/1660 variables, 1356/2444 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1660 variables, 0/2444 constraints. Problems are: Problem set: 0 solved, 236 unsolved
SMT process timed out in 30180ms, After SMT, problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 30182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33370 ms. Remains : 1389/1389 places, 304/304 transitions.
Built C files in :
/tmp/ltsmin14900406112962671425
[2025-06-05 15:50:30] [INFO ] Computing symmetric may disable matrix : 304 transitions.
[2025-06-05 15:50:30] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:50:30] [INFO ] Computing symmetric may enable matrix : 304 transitions.
[2025-06-05 15:50:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:50:30] [INFO ] Computing Do-Not-Accords matrix : 304 transitions.
[2025-06-05 15:50:30] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:50:30] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14900406112962671425
Running compilation step : cd /tmp/ltsmin14900406112962671425;'/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 1145 ms.
Running link step : cd /tmp/ltsmin14900406112962671425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14900406112962671425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14067980702446137201.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 15:50:45] [INFO ] Flatten gal took : 71 ms
[2025-06-05 15:50:46] [INFO ] Flatten gal took : 37 ms
[2025-06-05 15:50:46] [INFO ] Time to serialize gal into /tmp/LTL12146937439177210071.gal : 4 ms
[2025-06-05 15:50:46] [INFO ] Time to serialize properties into /tmp/LTL17009883468667433645.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12146937439177210071.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11035893015658598118.hoa' '-atoms' '/tmp/LTL17009883468667433645.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17009883468667433645.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11035893015658598118.hoa
Detected timeout of ITS tools.
[2025-06-05 15:51:01] [INFO ] Flatten gal took : 32 ms
[2025-06-05 15:51:01] [INFO ] Flatten gal took : 29 ms
[2025-06-05 15:51:01] [INFO ] Time to serialize gal into /tmp/LTL18167216291696336826.gal : 6 ms
[2025-06-05 15:51:01] [INFO ] Time to serialize properties into /tmp/LTL8054081997956488842.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18167216291696336826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8054081997956488842.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Cst...422
Formula 0 simplified : GF!"(((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Cstar...416
Detected timeout of ITS tools.
[2025-06-05 15:51:16] [INFO ] Flatten gal took : 28 ms
[2025-06-05 15:51:16] [INFO ] Applying decomposition
[2025-06-05 15:51:16] [INFO ] Flatten gal took : 28 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/graph7464566292595444770.txt' '-o' '/tmp/graph7464566292595444770.bin' '-w' '/tmp/graph7464566292595444770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7464566292595444770.bin' '-l' '-1' '-v' '-w' '/tmp/graph7464566292595444770.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:51:16] [INFO ] Decomposing Gal with order
[2025-06-05 15:51:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:51:16] [INFO ] Removed a total of 230 redundant transitions.
[2025-06-05 15:51:16] [INFO ] Flatten gal took : 94 ms
[2025-06-05 15:51:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 448 labels/synchronizations in 125 ms.
[2025-06-05 15:51:16] [INFO ] Time to serialize gal into /tmp/LTL15178890006252742203.gal : 14 ms
[2025-06-05 15:51:16] [INFO ] Time to serialize properties into /tmp/LTL12324109731071316373.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15178890006252742203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12324109731071316373.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((gu55.Cstart_0+gu55.Cstart_1)+(gu55.Cstart_2+gu55.Cstart_3))+((gu55.Cstart_4+gu55.Cstart_5)+(gu55.Cstart_6+gu55.Cstart_7...587
Formula 0 simplified : GF!"(((((((gu55.Cstart_0+gu55.Cstart_1)+(gu55.Cstart_2+gu55.Cstart_3))+((gu55.Cstart_4+gu55.Cstart_5)+(gu55.Cstart_6+gu55.Cstart_7))...581
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-01 finished in 150918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U ((X(X(!p1))&&X(!p0)&&(!p2 U (p3||G(!p2))))||G(X(!p0)))))'
Support contains 1190 out of 3773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3737 transition count 506
Applied a total of 36 rules in 186 ms. Remains 3737 /3773 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2025-06-05 15:51:32] [INFO ] Computed 3233 invariants in 298 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:51:38] [INFO ] Implicit Places using invariants in 6002 ms returned []
[2025-06-05 15:51:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:51:53] [INFO ] Implicit Places using invariants and state equation in 14957 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 20966 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3773 places, 506/506 transitions.
Applied a total of 0 rules in 170 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21323 ms. Remains : 3704/3773 places, 506/506 transitions.
Stuttering acceptance computed with spot in 450 ms :[true, p0, (OR (AND p0 p2 (NOT p3)) (AND p0 p1)), (AND p0 p2 (NOT p3)), (AND (NOT p3) p2), p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-05 finished in 21831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((F(p1)&&X(p2))))))'
Support contains 1094 out of 3773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 3738 transition count 506
Applied a total of 35 rules in 187 ms. Remains 3738 /3773 variables (removed 35) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3738 cols
[2025-06-05 15:51:54] [INFO ] Computed 3233 invariants in 87 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:51:57] [INFO ] Implicit Places using invariants in 3804 ms returned []
[2025-06-05 15:51:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:04] [INFO ] Implicit Places using invariants and state equation in 6852 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 10661 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3705/3773 places, 506/506 transitions.
Applied a total of 0 rules in 209 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11057 ms. Remains : 3705/3773 places, 506/506 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-07
Product exploration explored 100000 steps with 4962 reset in 1169 ms.
Product exploration explored 100000 steps with 4926 reset in 1248 ms.
Computed a total of 3705 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3705 transition count 506
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) p1 (NOT p2)), (X p1), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 528 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (1071 resets) in 1472 ms. (27 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 760 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (35 resets) in 643 ms. (62 steps per ms) remains 2/2 properties
// Phase 1: matrix 506 rows 3705 cols
[2025-06-05 15:52:09] [INFO ] Computed 3200 invariants in 32 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/1125 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1056/2181 variables, 1024/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2181 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 333/2514 variables, 2181/4261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2514 variables, 0/4261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 466/2980 variables, 299/4560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2980 variables, 32/4592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2980 variables, 0/4592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1226/4206 variables, 1222/5814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4206 variables, 1088/6902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4206 variables, 0/6902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/4211 variables, 3/6905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4211 variables, 0/6905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4211 variables, 0/6905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4211/4211 variables, and 6905 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2717 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3705/3705 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/1125 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1056/2181 variables, 1024/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2181 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2514/4211 variables, and 4261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3299 ms.
Refiners :[Generalized P Invariants (flows): 2080/3200 constraints, State Equation: 2181/3705 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6079ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1092 out of 3705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Graph (complete) has 40993 edges and 3705 vertex of which 2615 are kept as prefixes of interest. Removing 1090 places using SCC suffix rule.3 ms
Discarding 1090 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 2615 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 2614 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 73 place count 2614 transition count 434
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 2613 transition count 434
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 140 place count 2548 transition count 369
Iterating global reduction 2 with 65 rules applied. Total rules applied 205 place count 2548 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 2547 transition count 368
Applied a total of 206 rules in 295 ms. Remains 2547 /3705 variables (removed 1158) and now considering 368/506 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 2547/3705 places, 368/506 transitions.
RANDOM walk for 40000 steps (1010 resets) in 1978 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 720 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 688 ms. (58 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 6937 steps, run visited all 2 properties in 370 ms. (steps per millisecond=18 )
Probabilistic random walk after 6937 steps, saw 6804 distinct states, run finished after 374 ms. (steps per millisecond=18 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p1), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p2), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 745 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
[2025-06-05 15:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 15:52:33] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 15:52:33] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 13893 ms returned unknown
Could not prove EG (NOT p2)
Support contains 1092 out of 3705 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 198 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 15:52:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:37] [INFO ] Implicit Places using invariants in 3723 ms returned []
[2025-06-05 15:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:43] [INFO ] Implicit Places using invariants and state equation in 5930 ms returned []
Implicit Place search using SMT with State Equation took 9656 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:52:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4211 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3705 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4211 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3705 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Finished structural reductions in LTL mode , in 1 iterations and 70300 ms. Remains : 3705/3705 places, 506/506 transitions.
Computed a total of 3705 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3705 transition count 506
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 p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (1068 resets) in 1552 ms. (25 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (37 resets) in 758 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (44 resets) in 767 ms. (52 steps per ms) remains 2/2 properties
[2025-06-05 15:53:45] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/1125 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1056/2181 variables, 1024/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2181 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2514/4211 variables, and 4261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3030 ms.
Refiners :[Generalized P Invariants (flows): 2080/3200 constraints, State Equation: 2181/3705 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/1125 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1056/2181 variables, 1024/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2181 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2514/4211 variables, and 4261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3150 ms.
Refiners :[Generalized P Invariants (flows): 2080/3200 constraints, State Equation: 2181/3705 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6198ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1092 out of 3705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Graph (complete) has 40993 edges and 3705 vertex of which 2615 are kept as prefixes of interest. Removing 1090 places using SCC suffix rule.9 ms
Discarding 1090 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 2615 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 2614 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 73 place count 2614 transition count 434
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 2613 transition count 434
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 140 place count 2548 transition count 369
Iterating global reduction 2 with 65 rules applied. Total rules applied 205 place count 2548 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 2547 transition count 368
Applied a total of 206 rules in 243 ms. Remains 2547 /3705 variables (removed 1158) and now considering 368/506 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 2547/3705 places, 368/506 transitions.
RANDOM walk for 40000 steps (1005 resets) in 1948 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 814 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 843 ms. (47 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 6937 steps, run visited all 2 properties in 329 ms. (steps per millisecond=21 )
Probabilistic random walk after 6937 steps, saw 6804 distinct states, run finished after 332 ms. (steps per millisecond=20 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
[2025-06-05 15:53:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 15:54:09] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 13651 ms returned sat
[2025-06-05 15:54:09] [INFO ] [Real]Absence check using state equation in 209 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 4017 reset in 1634 ms.
Product exploration explored 100000 steps with 4008 reset in 1667 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Support contains 1092 out of 3705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Graph (complete) has 40993 edges and 3705 vertex of which 3704 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output 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 3704 transition count 507
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 443 ms. Remains 3704 /3705 variables (removed 1) and now considering 507/506 (removed -1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:54:13] [INFO ] Redundant transitions in 20 ms returned []
Running 473 sub problems to find dead transitions.
// Phase 1: matrix 507 rows 3704 cols
[2025-06-05 15:54:13] [INFO ] Computed 3200 invariants in 105 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4211 variables, and 3200 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3704 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4211 variables, and 3200 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3704 constraints, PredecessorRefiner: 0/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60619ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60621ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3704/3705 places, 507/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61105 ms. Remains : 3704/3705 places, 507/506 transitions.
Built C files in :
/tmp/ltsmin4525796569370659642
[2025-06-05 15:55:14] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4525796569370659642
Running compilation step : cd /tmp/ltsmin4525796569370659642;'/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 2436 ms.
Running link step : cd /tmp/ltsmin4525796569370659642;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4525796569370659642;'/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/stateBased7374600057553318882.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1092 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3704 transition count 506
Applied a total of 1 rules in 175 ms. Remains 3704 /3705 variables (removed 1) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2025-06-05 15:55:29] [INFO ] Computed 3200 invariants in 77 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:55:33] [INFO ] Implicit Places using invariants in 3786 ms returned []
[2025-06-05 15:55:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:55:39] [INFO ] Implicit Places using invariants and state equation in 6556 ms returned []
Implicit Place search using SMT with State Equation took 10343 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:55:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4210 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3704 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 1)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 1)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 1)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 1)
(s1893 1)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 1)
(s1898 1)
(s1899 1)
(s1900 1)
(s1901 1)
(s1902 1)
(s1903 1)
(s1904 1)
(s1905 1)
(s1906 1)
(s1907 1)
(s1908 1)
(s1909 1)
(s1910 1)
(s1911 1)
(s1912 1)
(s1913 1)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 1)
(s1918 1)
(s1919 1)
(s1920 1)
(s1921 1)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 1)
(s1929 1)
(s1930 1)
(s1931 1)
(s1932 1)
(s1933 1)
(s1934 1)
(s1935 1)
(s1936 1)
(s1937 1)
(s1938 1)
(s1939 1)
(s1940 1)
(s1941 1)
(s1942 1)
(s1943 1)
(s1944 1)
(s1945 1)
(s1946 1)
(s1947 1)
(s1948 1)
(s1949 1)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 1)
(s2068 1)
(s2069 1)
(s2070 1)
(s2071 1)
(s2072 1)
(s2073 1)
(s2074 1)
(s2075 1)
(s2076 1)
(s2077 1)
(s2078 1)
(s2079 1)
(s2080 1)
(s2081 1)
(s2082 1)
(s2083 1)
(s2084 1)
(s2085 1)
(s2086 1)
(s2087 1)
(s2088 1)
(s2089 1)
(s2090 1)
(s2091 1)
(s2092 1)
(s2093 1)
(s2094 1)
(s2095 1)
(s2096 1)
(s2097 1)
(s2098 1)
(s2099 1)
(s2100 1)
(s2101 1)
(s2102 1)
(s2103 1)
(s2104 1)
(s2105 1)
(s2106 1)
(s2107 1)
(s2108 1)
(s2109 1)
(s2110 1)
(s2111 1)
(s2112 1)
(s2113 1)
(s2114 1)
(s2115 1)
(s2116 1)
(s2117 1)
(s2118 1)
(s2119 1)
(s2120 1)
(s2121 1)
(s2122 1)
(s2123 1)
(s2124 1)
(s2125 1)
(s2126 1)
(s2127 1)
(s2128 1)
(s2129 1)
(s2130 1)
(s2131 1)
(s2132 1)
(s2133 1)
(s2134 1)
(s2135 1)
(s2136 1)
(s2137 1)
(s2138 1)
(s2139 1)
(s2140 1)
(s2141 1)
(s2142 1)
(s2143 1)
(s2144 1)
(s2145 1)
(s2146 1)
(s2147 1)
(s2148 1)
(s2149 1)
(s2150 1)
(s2151 1)
(s2152 1)
(s2153 1)
(s2154 1)
(s2155 1)
(s2156 1)
(s2157 1)
(s2158 1)
(s2159 1)
(s2160 1)
(s2161 1)
(s2162 1)
(s2163 1)
(s2164 1)
(s2165 1)
(s2166 1)
(s2167 1)
(s2168 1)
(s2169 1)
(s2170 1)
(s2171 1)
(s2172 1)
(s2173 1)
(s2174 1)
(s2175 1)
(s2176 1)
(s2177 1)
(s2178 1)
(s2179 1)
(s2180 1)
(s2181 1)
(s2182 1)
(s2183 1)
(s2184 1)
(s2185 1)
(s2186 1)
(s2187 1)
(s2188 1)
(s2189 1)
(s2190 1)
(s2191 1)
(s2192 1)
(s2193 1)
(s2194 1)
(s2195 1)
(s2196 1)
(s2197 1)
(s2198 1)
(s2199 1)
(s2200 1)
(s2201 1)
(s2202 1)
(s2203 1)
(s2204 1)
(s2205 1)
(s2206 1)
(s2207 1)
(s2208 1)
(s2209 1)
(s2210 1)
(s2211 1)
(s2212 1)
(s2213 1)
(s2214 1)
(s2215 1)
(s2216 1)
(s2217 1)
(s2218 1)
(s2219 1)
(s2220 1)
(s2221 1)
(s2222 1)
(s2223 1)
(s2224 1)
(s2225 1)
(s2226 1)
(s2227 1)
(s2228 1)
(s2229 1)
(s2230 1)
(s2231 1)
(s2232 1)
(s2233 1)
(s2234 1)
(s2235 1)
(s2236 1)
(s2237 1)
(s2238 1)
(s2239 1)
(s2240 1)
(s2241 1)
(s2242 1)
(s2243 1)
(s2244 1)
(s2245 1)
(s2246 1)
(s2247 1)
(s2248 1)
(s2249 1)
(s2250 1)
(s2251 1)
(s2252 1)
(s2253 1)
(s2254 1)
(s2255 1)
(s2256 1)
(s2257 1)
(s2258 1)
(s2259 1)
(s2260 1)
(s2261 1)
(s2262 1)
(s2263 1)
(s2264 1)
(s2265 1)
(s2266 1)
(s2267 1)
(s2268 1)
(s2269 1)
(s2270 1)
(s2271 1)
(s2272 1)
(s2273 1)
(s2274 1)
(s2275 1)
(s2276 1)
(s2277 1)
(s2278 1)
(s2279 1)
(s2280 1)
(s2281 1)
(s2282 1)
(s2283 1)
(s2284 1)
(s2285 1)
(s2286 1)
(s2287 1)
(s2288 1)
(s2289 1)
(s2290 1)
(s2291 1)
(s2292 1)
(s2293 1)
(s2294 1)
(s2295 1)
(s2296 1)
(s2297 1)
(s2298 1)
(s2299 1)
(s2300 1)
(s2301 1)
(s2302 1)
(s2303 1)
(s2304 1)
(s2305 1)
(s2306 1)
(s2307 1)
(s2308 1)
(s2309 1)
(s2310 1)
(s2311 1)
(s2312 1)
(s2313 1)
(s2314 1)
(s2315 1)
(s2316 1)
(s2317 1)
(s2318 1)
(s2319 1)
(s2320 1)
(s2321 1)
(s2322 1)
(s2323 1)
(s2324 1)
(s2325 1)
(s2326 1)
(s2327 1)
(s2328 1)
(s2329 1)
(s2330 1)
(s2331 1)
(s2332 1)
(s2333 1)
(s2334 1)
(s2335 1)
(s2336 1)
(s2337 1)
(s2338 1)
(s2339 1)
(s2340 1)
(s2341 1)
(s2342 1)
(s2343 1)
(s2344 1)
(s2345 1)
(s2346 1)
(s2347 1)
(s2348 1)
(s2349 1)
(s2350 1)
(s2351 1)
(s2352 1)
(s2353 1)
(s2354 1)
(s2355 1)
(s2356 1)
(s2357 1)
(s2358 1)
(s2359 1)
(s2360 1)
(s2361 1)
(s2362 1)
(s2363 1)
(s2364 1)
(s2365 1)
(s2366 1)
(s2367 1)
(s2368 1)
(s2369 1)
(s2370 1)
(s2371 1)
(s2372 1)
(s2373 1)
(s2374 1)
(s2375 1)
(s2376 1)
(s2377 1)
(s2378 1)
(s2379 1)
(s2380 1)
(s2381 1)
(s2382 1)
(s2383 1)
(s2384 1)
(s2385 1)
(s2386 1)
(s2387 1)
(s2388 1)
(s2389 1)
(s2390 1)
(s2391 1)
(s2392 1)
(s2393 1)
(s2394 1)
(s2395 1)
(s2396 1)
(s2397 1)
(s2398 1)
(s2399 1)
(s2400 1)
(s2401 1)
(s2402 1)
(s2403 1)
(s2404 1)
(s2405 1)
(s2406 1)
(s2407 1)
(s2408 1)
(s2409 1)
(s2410 1)
(s2411 1)
(s2412 1)
(s2413 1)
(s2414 1)
(s2415 1)
(s2416 1)
(s2417 1)
(s2418 1)
(s2419 1)
(s2420 1)
(s2421 1)
(s2422 1)
(s2423 1)
(s2424 1)
(s2425 1)
(s2426 1)
(s2427 1)
(s2428 1)
(s2429 1)
(s2430 1)
(s2431 1)
(s2432 1)
(s2433 1)
(s2434 1)
(s2435 1)
(s2436 1)
(s2437 1)
(s2438 1)
(s2439 1)
(s2440 1)
(s2441 1)
(s2442 1)
(s2443 1)
(s2444 1)
(s2445 1)
(s2446 1)
(s2447 1)
(s2448 1)
(s2449 1)
(s2450 1)
(s2451 1)
(s2452 1)
(s2453 1)
(s2454 1)
(s2455 1)
(s2456 1)
(s2457 1)
(s2458 1)
(s2459 1)
(s2460 1)
(s2461 1)
(s2462 1)
(s2463 1)
(s2464 1)
(s2465 1)
(s2466 1)
(s2467 1)
(s2468 1)
(s2469 1)
(s2470 1)
(s2471 1)
(s2472 1)
(s2473 1)
(s2474 1)
(s2475 1)
(s2476 1)
(s2477 1)
(s2478 1)
(s2479 1)
(s2480 1)
(s2481 1)
(s2482 1)
(s2483 1)
(s2484 1)
(s2485 1)
(s2486 1)
(s2487 1)
(s2488 1)
(s2489 1)
(s2490 1)
(s2491 1)
(s2492 1)
(s2493 1)
(s2494 1)
(s2495 1)
(s2496 1)
(s2497 1)
(s2498 1)
(s2499 1)
(s2500 1)
(s2501 1)
(s2502 1)
(s2503 1)
(s2504 1)
(s2505 1)
(s2506 1)
(s2507 1)
(s2508 1)
(s2509 1)
(s2510 1)
(s2511 1)
(s2512 1)
(s2513 1)
(s2514 1)
(s2515 1)
(s2516 1)
(s2517 1)
(s2518 1)
(s2519 1)
(s2520 1)
(s2521 1)
(s2522 1)
(s2523 1)
(s2524 1)
(s2525 1)
(s2526 1)
(s2527 1)
(s2528 1)
(s2529 1)
(s2530 1)
(s2531 1)
(s2532 1)
(s2533 1)
(s2534 1)
(s2535 1)
(s2536 1)
(s2537 1)
(s2538 1)
(s2539 1)
(s2540 1)
(s2541 1)
(s2542 1)
(s2543 1)
(s2544 1)
(s2545 1)
(s2546 1)
(s2547 1)
(s2548 1)
(s2549 1)
(s2550 1)
(s2551 1)
(s2552 1)
(s2553 1)
(s2554 1)
(s2555 1)
(s2556 1)
(s2557 1)
(s2558 1)
(s2559 1)
(s2560 1)
(s2561 1)
(s2562 1)
(s2563 1)
(s2564 1)
(s2565 1)
(s2566 1)
(s2567 1)
(s2568 1)
(s2569 1)
(s2570 1)
(s2571 1)
(s2572 1)
(s2573 1)
(s2574 1)
(s2575 1)
(s2576 1)
(s2577 1)
(s2578 1)
(s2579 1)
(s2580 1)
(s2581 1)
(s2582 1)
(s2583 1)
(s2584 1)
(s2585 1)
(s2586 1)
(s2587 1)
(s2588 1)
(s2589 1)
(s2590 1)
(s2591 1)
(s2592 1)
(s2593 1)
(s2594 1)
(s2595 1)
(s2596 1)
(s2597 1)
(s2598 1)
(s2599 1)
(s2600 1)
(s2601 1)
(s2602 1)
(s2603 1)
(s2604 1)
(s2605 1)
(s2606 1)
(s2607 1)
(s2608 1)
(s2609 1)
(s2610 1)
(s2611 1)
(s2612 1)
(s2613 1)
(s2614 1)
(s2615 1)
(s2616 1)
(s2617 1)
(s2618 1)
(s2619 1)
(s2620 1)
(s2621 1)
(s2622 1)
(s2623 1)
(s2624 1)
(s2625 1)
(s2626 1)
(s2627 1)
(s2628 1)
(s2629 1)
(s2630 1)
(s2631 1)
(s2632 1)
(s2633 1)
(s2634 1)
(s2635 1)
(s2636 1)
(s2637 1)
(s2638 1)
(s2639 1)
(s2640 1)
(s2641 1)
(s2642 1)
(s2643 1)
(s2644 1)
(s2645 1)
(s2646 1)
(s2647 1)
(s2648 1)
(s2649 1)
(s2650 1)
(s2651 1)
(s2652 1)
(s2653 1)
(s2654 1)
(s2655 1)
(s2656 1)
(s2657 1)
(s2658 1)
(s2659 1)
(s2660 1)
(s2661 1)
(s2662 1)
(s2663 1)
(s2664 1)
(s2665 1)
(s2666 1)
(s2667 1)
(s2668 1)
(s2669 1)
(s2670 1)
(s2671 1)
(s2672 1)
(s2673 1)
(s2674 1)
(s2675 1)
(s2676 1)
(s2677 1)
(s2678 1)
(s2679 1)
(s2680 1)
(s2681 1)
(s2682 1)
(s2683 1)
(s2684 1)
(s2685 1)
(s2686 1)
(s2687 1)
(s2688 1)
(s2689 1)
(s2690 1)
(s2691 1)
(s2692 1)
(s2693 1)
(s2694 1)
(s2695 1)
(s2696 1)
(s2697 1)
(s2698 1)
(s2699 1)
(s2700 1)
(s2701 1)
(s2702 1)
(s2703 1)
(s2704 1)
(s2705 1)
(s2706 1)
(s2707 1)
(s2708 1)
(s2709 1)
(s2710 1)
(s2711 1)
(s2712 1)
(s2713 1)
(s2714 1)
(s2715 1)
(s2716 1)
(s2717 1)
(s2718 1)
(s2719 1)
(s2720 1)
(s2721 1)
(s2722 1)
(s2723 1)
(s2724 1)
(s2725 1)
(s2726 1)
(s2727 1)
(s2728 1)
(s2729 1)
(s2730 1)
(s2731 1)
(s2732 1)
(s2733 1)
(s2734 1)
(s2735 1)
(s2736 1)
(s2737 1)
(s2738 1)
(s2739 1)
(s2740 1)
(s2741 1)
(s2742 1)
(s2743 1)
(s2744 1)
(s2745 1)
(s2746 1)
(s2747 1)
(s2748 1)
(s2749 1)
(s2750 1)
(s2751 1)
(s2752 1)
(s2753 1)
(s2754 1)
(s2755 1)
(s2756 1)
(s2757 1)
(s2758 1)
(s2759 1)
(s2760 1)
(s2761 1)
(s2762 1)
(s2763 1)
(s2764 1)
(s2765 1)
(s2766 1)
(s2767 1)
(s2768 1)
(s2769 1)
(s2770 1)
(s2771 1)
(s2772 1)
(s2773 1)
(s2774 1)
(s2775 1)
(s2776 1)
(s2777 1)
(s2778 1)
(s2779 1)
(s2780 1)
(s2781 1)
(s2782 1)
(s2783 1)
(s2784 1)
(s2785 1)
(s2786 1)
(s2787 1)
(s2788 1)
(s2789 1)
(s2790 1)
(s2791 1)
(s2792 1)
(s2793 1)
(s2794 1)
(s2795 1)
(s2796 1)
(s2797 1)
(s2798 1)
(s2799 1)
(s2800 1)
(s2801 1)
(s2802 1)
(s2803 1)
(s2804 1)
(s2805 1)
(s2806 1)
(s2807 1)
(s2808 1)
(s2809 1)
(s2810 1)
(s2811 1)
(s2812 1)
(s2813 1)
(s2814 1)
(s2815 1)
(s2816 1)
(s2817 1)
(s2818 1)
(s2819 1)
(s2820 1)
(s2821 1)
(s2822 1)
(s2823 1)
(s2824 1)
(s2825 1)
(s2826 1)
(s2827 1)
(s2828 1)
(s2829 1)
(s2830 1)
(s2831 1)
(s2832 1)
(s2833 1)
(s2834 1)
(s2835 1)
(s2836 1)
(s2837 1)
(s2838 1)
(s2839 1)
(s2840 1)
(s2841 1)
(s2842 1)
(s2843 1)
(s2844 1)
(s2845 1)
(s2846 1)
(s2847 1)
(s2848 1)
(s2849 1)
(s2850 1)
(s2851 1)
(s2852 1)
(s2853 1)
(s2854 1)
(s2855 1)
(s2856 1)
(s2857 1)
(s2858 1)
(s2859 1)
(s2860 1)
(s2861 1)
(s2862 1)
(s2863 1)
(s2864 1)
(s2865 1)
(s2866 1)
(s2867 1)
(s2868 1)
(s2869 1)
(s2870 1)
(s2871 1)
(s2872 1)
(s2873 1)
(s2874 1)
(s2875 1)
(s2876 1)
(s2877 1)
(s2878 1)
(s2879 1)
(s2880 1)
(s2881 1)
(s2882 1)
(s2883 1)
(s2884 1)
(s2885 1)
(s2886 1)
(s2887 1)
(s2888 1)
(s2889 1)
(s2890 1)
(s2891 1)
(s2892 1)
(s2893 1)
(s2894 1)
(s2895 1)
(s2896 1)
(s2897 1)
(s2898 1)
(s2899 1)
(s2900 1)
(s2901 1)
(s2902 1)
(s2903 1)
(s2904 1)
(s2905 1)
(s2906 1)
(s2907 1)
(s2908 1)
(s2909 1)
(s2910 1)
(s2911 1)
(s2912 1)
(s2913 1)
(s2914 1)
(s2915 1)
(s2916 1)
(s2917 1)
(s2918 1)
(s2919 1)
(s2920 1)
(s2921 1)
(s2922 1)
(s2923 1)
(s2924 1)
(s2925 1)
(s2926 1)
(s2927 1)
(s2928 1)
(s2929 1)
(s2930 1)
(s2931 1)
(s2932 1)
(s2933 1)
(s2934 1)
(s2935 1)
(s2936 1)
(s2937 1)
(s2938 1)
(s2939 1)
(s2940 1)
(s2941 1)
(s2942 1)
(s2943 1)
(s2944 1)
(s2945 1)
(s2946 1)
(s2947 1)
(s2948 1)
(s2949 1)
(s2950 1)
(s2951 1)
(s2952 1)
(s2953 1)
(s2954 1)
(s2955 1)
(s2956 1)
(s2957 1)
(s2958 1)
(s2959 1)
(s2960 1)
(s2961 1)
(s2962 1)
(s2963 1)
(s2964 1)
(s2965 1)
(s2966 1)
(s2967 1)
(s2968 1)
(s2969 1)
(s2970 1)
(s2971 1)
(s2972 1)
(s2973 1)
(s2974 1)
(s2975 1)
(s2976 1)
(s2977 1)
(s2978 1)
(s2979 1)
(s2980 1)
(s2981 1)
(s2982 1)
(s2983 1)
(s2984 1)
(s2985 1)
(s2986 1)
(s2987 1)
(s2988 1)
(s2989 1)
(s2990 1)
(s2991 1)
(s2992 1)
(s2993 1)
(s2994 1)
(s2995 1)
(s2996 1)
(s2997 1)
(s2998 1)
(s2999 1)
(s3000 1)
(s3001 1)
(s3002 1)
(s3003 1)
(s3004 1)
(s3005 1)
(s3006 1)
(s3007 1)
(s3008 1)
(s3009 1)
(s3010 1)
(s3011 1)
(s3012 1)
(s3013 1)
(s3014 1)
(s3015 1)
(s3016 1)
(s3017 1)
(s3018 1)
(s3019 1)
(s3020 1)
(s3021 1)
(s3022 1)
(s3023 1)
(s3024 1)
(s3025 1)
(s3026 1)
(s3027 1)
(s3028 1)
(s3029 1)
(s3030 1)
(s3031 1)
(s3032 1)
(s3033 1)
(s3034 1)
(s3035 1)
(s3036 1)
(s3037 1)
(s3038 1)
(s3039 1)
(s3040 1)
(s3041 1)
(s3042 1)
(s3043 1)
(s3044 1)
(s3045 1)
(s3046 1)
(s3047 1)
(s3048 1)
(s3049 1)
(s3050 1)
(s3051 1)
(s3052 1)
(s3053 1)
(s3054 1)
(s3055 1)
(s3056 1)
(s3057 1)
(s3058 1)
(s3059 1)
(s3060 1)
(s3061 1)
(s3062 1)
(s3063 1)
(s3064 1)
(s3065 1)
(s3066 1)
(s3067 1)
(s3068 1)
(s3069 1)
(s3070 1)
(s3071 1)
(s3072 1)
(s3073 1)
(s3074 1)
(s3075 1)
(s3076 1)
(s3077 1)
(s3078 1)
(s3079 1)
(s3080 1)
(s3081 1)
(s3082 1)
(s3083 1)
(s3084 1)
(s3085 1)
(s3086 1)
(s3087 1)
(s3088 1)
(s3089 1)
(s3090 1)
(s3091 1)
(s3092 1)
(s3093 1)
(s3094 1)
(s3095 1)
(s3096 1)
(s3097 1)
(s3098 1)
(s3099 1)
(s3100 1)
(s3101 1)
(s3102 1)
(s3103 1)
(s3104 1)
(s3105 1)
(s3106 1)
(s3107 1)
(s3108 1)
(s3109 1)
(s3110 1)
(s3111 1)
(s3112 1)
(s3113 1)
(s3114 1)
(s3115 1)
(s3116 1)
(s3117 1)
(s3118 1)
(s3119 1)
(s3120 1)
(s3121 1)
(s3122 1)
(s3123 1)
(s3124 1)
(s3125 1)
(s3126 1)
(s3127 1)
(s3128 1)
(s3129 1)
(s3130 1)
(s3131 1)
(s3132 1)
(s3133 1)
(s3134 1)
(s3135 1)
(s3136 1)
(s3137 1)
(s3138 1)
(s3139 1)
(s3140 1)
(s3141 1)
(s3142 1)
(s3143 1)
(s3144 1)
(s3145 1)
(s3146 1)
(s3147 1)
(s3148 1)
(s3149 1)
(s3150 1)
(s3151 1)
(s3152 1)
(s3153 1)
(s3154 1)
(s3155 1)
(s3156 1)
(s3157 1)
(s3158 1)
(s3159 1)
(s3160 1)
(s3161 1)
(s3162 1)
(s3163 1)
(s3164 1)
(s3165 1)
(s3166 1)
(s3167 1)
(s3168 1)
(s3169 1)
(s3170 1)
(s3171 1)
(s3172 1)
(s3173 1)
(s3174 1)
(s3175 1)
(s3176 1)
(s3177 1)
(s3178 1)
(s3179 1)
(s3180 1)
(s3181 1)
(s3182 1)
(s3183 1)
(s3184 1)
(s3185 1)
(s3186 1)
(s3187 1)
(s3188 1)
(s3189 1)
(s3190 1)
(s3191 1)
(s3192 1)
(s3193 1)
(s3194 1)
(s3195 1)
(s3196 1)
(s3197 1)
(s3198 1)
(s3199 1)
(s3200 1)
(s3201 1)
(s3202 1)
(s3203 1)
(s3204 1)
(s3205 1)
(s3206 1)
(s3207 1)
(s3208 1)
(s3209 1)
(s3210 1)
(s3211 1)
(s3212 1)
(s3213 1)
(s3214 1)
(s3215 1)
(s3216 1)
(s3217 1)
(s3218 1)
(s3219 1)
(s3220 1)
(s3221 1)
(s3222 1)
(s3223 1)
(s3224 1)
(s3225 1)
(s3226 1)
(s3227 1)
(s3228 1)
(s3229 1)
(s3230 1)
(s3231 1)
(s3232 1)
(s3233 1)
(s3234 1)
(s3235 1)
(s3236 1)
(s3237 1)
(s3238 1)
(s3239 1)
(s3240 1)
(s3241 1)
(s3242 1)
(s3243 1)
(s3244 1)
(s3245 1)
(s3246 1)
(s3247 1)
(s3248 1)
(s3249 1)
(s3250 1)
(s3251 1)
(s3252 1)
(s3253 1)
(s3254 1)
(s3255 1)
(s3256 1)
(s3257 1)
(s3258 1)
(s3259 1)
(s3260 1)
(s3261 1)
(s3262 1)
(s3263 1)
(s3264 1)
(s3265 1)
(s3266 1)
(s3267 1)
(s3268 1)
(s3269 1)
(s3270 1)
(s3271 1)
(s3272 1)
(s3273 1)
(s3274 1)
(s3275 1)
(s3276 1)
(s3277 1)
(s3278 1)
(s3279 1)
(s3280 1)
(s3281 1)
(s3282 1)
(s3283 1)
(s3284 1)
(s3285 1)
(s3286 1)
(s3287 1)
(s3288 1)
(s3289 1)
(s3290 1)
(s3291 1)
(s3292 1)
(s3293 1)
(s3294 1)
(s3295 1)
(s3296 1)
(s3297 1)
(s3298 1)
(s3299 1)
(s3300 1)
(s3301 1)
(s3302 1)
(s3303 1)
(s3304 1)
(s3305 1)
(s3306 1)
(s3307 1)
(s3308 1)
(s3309 1)
(s3310 1)
(s3311 1)
(s3312 1)
(s3313 1)
(s3314 1)
(s3315 1)
(s3316 1)
(s3317 1)
(s3318 1)
(s3319 1)
(s3320 1)
(s3321 1)
(s3322 1)
(s3323 1)
(s3324 1)
(s3325 1)
(s3326 1)
(s3327 1)
(s3328 1)
(s3329 1)
(s3330 1)
(s3331 1)
(s3332 1)
(s3333 1)
(s3334 1)
(s3335 1)
(s3336 1)
(s3337 1)
(s3338 1)
(s3339 1)
(s3340 1)
(s3341 1)
(s3342 1)
(s3343 1)
(s3344 1)
(s3345 1)
(s3346 1)
(s3347 1)
(s3348 1)
(s3349 1)
(s3350 1)
(s3351 1)
(s3352 1)
(s3353 1)
(s3354 1)
(s3355 1)
(s3356 1)
(s3357 1)
(s3358 1)
(s3359 1)
(s3360 1)
(s3361 1)
(s3362 1)
(s3363 1)
(s3364 1)
(s3365 1)
(s3366 1)
(s3367 1)
(s3368 1)
(s3369 1)
(s3370 1)
(s3371 1)
(s3372 1)
(s3373 1)
(s3374 1)
(s3375 1)
(s3376 1)
(s3377 1)
(s3378 1)
(s3379 1)
(s3380 1)
(s3381 1)
(s3382 1)
(s3383 1)
(s3384 1)
(s3385 1)
(s3386 1)
(s3387 1)timeout
(s3388 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4210 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3704 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60470ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Starting structural reductions in LTL mode, iteration 1 : 3704/3705 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70995 ms. Remains : 3704/3705 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin3902813198214415318
[2025-06-05 15:56:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3902813198214415318
Running compilation step : cd /tmp/ltsmin3902813198214415318;'/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 2435 ms.
Running link step : cd /tmp/ltsmin3902813198214415318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3902813198214415318;'/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/stateBased17007943652937896909.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 15:56:55] [INFO ] Flatten gal took : 107 ms
[2025-06-05 15:56:55] [INFO ] Flatten gal took : 110 ms
[2025-06-05 15:56:55] [INFO ] Time to serialize gal into /tmp/LTL3879921595920093954.gal : 10 ms
[2025-06-05 15:56:55] [INFO ] Time to serialize properties into /tmp/LTL13800395674045366663.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3879921595920093954.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17957364274742508583.hoa' '-atoms' '/tmp/LTL13800395674045366663.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/LTL13800395674045366663.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17957364274742508583.hoa
Detected timeout of ITS tools.
[2025-06-05 15:57:10] [INFO ] Flatten gal took : 84 ms
[2025-06-05 15:57:10] [INFO ] Flatten gal took : 81 ms
[2025-06-05 15:57:10] [INFO ] Time to serialize gal into /tmp/LTL15989473745531142567.gal : 13 ms
[2025-06-05 15:57:10] [INFO ] Time to serialize properties into /tmp/LTL9936569241665145913.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15989473745531142567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9936569241665145913.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(Astart<=CstopAbort)"))&&(X(F((F("((((((((((((n8_0+n8_1)+(n8_2+n8_3))+((n8_4+n8_5)+(n8_6+n8_7)))+(((n8_8+n8_9)+(n8_10+n8_11))+(...9892
Formula 0 simplified : G!"(Astart<=CstopAbort)" | XG(G!"((((((((((((n8_0+n8_1)+(n8_2+n8_3))+((n8_4+n8_5)+(n8_6+n8_7)))+(((n8_8+n8_9)+(n8_10+n8_11))+((n8_12...9878
Detected timeout of ITS tools.
[2025-06-05 15:57:25] [INFO ] Flatten gal took : 72 ms
[2025-06-05 15:57:25] [INFO ] Applying decomposition
[2025-06-05 15:57:26] [INFO ] Flatten gal took : 72 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/graph6742793365306960361.txt' '-o' '/tmp/graph6742793365306960361.bin' '-w' '/tmp/graph6742793365306960361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6742793365306960361.bin' '-l' '-1' '-v' '-w' '/tmp/graph6742793365306960361.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:57:27] [INFO ] Decomposing Gal with order
[2025-06-05 15:57:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:57:27] [INFO ] Removed a total of 283 redundant transitions.
[2025-06-05 15:57:27] [INFO ] Flatten gal took : 182 ms
[2025-06-05 15:57:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 358 labels/synchronizations in 129 ms.
[2025-06-05 15:57:28] [INFO ] Time to serialize gal into /tmp/LTL16729375454229651390.gal : 29 ms
[2025-06-05 15:57:28] [INFO ] Time to serialize properties into /tmp/LTL5998530616562793749.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16729375454229651390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5998530616562793749.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gi1.gi2.gi21.gi2.gu0.Astart<=gi1.gi2.gi21.gi2.gu0.CstopAbort)"))&&(X(F((F("((((((((((((gu4.n8_0+gu4.n8_1)+(gu4.n8_2+gu4.n8_3))...14340
Formula 0 simplified : G!"(gi1.gi2.gi21.gi2.gu0.Astart<=gi1.gi2.gi21.gi2.gu0.CstopAbort)" | XG(G!"((((((((((((gu4.n8_0+gu4.n8_1)+(gu4.n8_2+gu4.n8_3))+((gu4...14326
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-07 finished in 350025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)||X(((p2 U p3) U (p0&&(p2 U p3))))) U X(p0)))'
Support contains 1190 out of 3773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3737 transition count 506
Applied a total of 36 rules in 159 ms. Remains 3737 /3773 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2025-06-05 15:57:44] [INFO ] Computed 3233 invariants in 77 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:49] [INFO ] Implicit Places using invariants in 5347 ms returned []
[2025-06-05 15:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:15] [INFO ] Implicit Places using invariants and state equation in 25890 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 31246 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3773 places, 506/506 transitions.
Applied a total of 0 rules in 172 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31577 ms. Remains : 3704/3773 places, 506/506 transitions.
Stuttering acceptance computed with spot in 361 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p3), (OR (NOT p3) (NOT p0)), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 4098 ms.
Product exploration explored 100000 steps with 50000 reset in 4104 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
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 p0 (NOT p1) p3 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 29 factoid took 23 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-08 finished in 42040 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(X(F(p0))))))'
Support contains 34 out of 3773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3737 transition count 506
Applied a total of 36 rules in 394 ms. Remains 3737 /3773 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2025-06-05 15:58:26] [INFO ] Computed 3232 invariants in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:32] [INFO ] Implicit Places using invariants in 6086 ms returned []
[2025-06-05 15:58:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:49] [INFO ] Implicit Places using invariants and state equation in 16877 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 22968 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3773 places, 506/506 transitions.
Applied a total of 0 rules in 388 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23750 ms. Remains : 3704/3773 places, 506/506 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-09
Product exploration explored 100000 steps with 25000 reset in 593 ms.
Product exploration explored 100000 steps with 25000 reset in 594 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
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 p0), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 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-COL-32-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-09 finished in 25659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 68 out of 3773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 3738 transition count 506
Applied a total of 35 rules in 392 ms. Remains 3738 /3773 variables (removed 35) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3738 cols
[2025-06-05 15:58:52] [INFO ] Computed 3233 invariants in 72 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:58] [INFO ] Implicit Places using invariants in 6382 ms returned []
[2025-06-05 15:58:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:21] [INFO ] Implicit Places using invariants and state equation in 23517 ms returned []
Implicit Place search using SMT with State Equation took 29903 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:59: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/3735 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4244 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 3200/3233 constraints, State Equation: 0/3738 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3735/4244 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 3200/3233 constraints, State Equation: 0/3738 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60532ms
Starting structural reductions in LTL mode, iteration 1 : 3738/3773 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90833 ms. Remains : 3738/3773 places, 506/506 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-10 finished in 90987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G((p1&&X((p1 U (p2||G(p1)))))) U p3))))'
Support contains 100 out of 3773 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 3736 transition count 506
Applied a total of 37 rules in 351 ms. Remains 3736 /3773 variables (removed 37) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2025-06-05 16:00:23] [INFO ] Computed 3232 invariants in 70 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:00:28] [INFO ] Implicit Places using invariants in 6047 ms returned []
[2025-06-05 16:00:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:00:44] [INFO ] Implicit Places using invariants and state equation in 15289 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 21338 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3773 places, 506/506 transitions.
Applied a total of 0 rules in 352 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22041 ms. Remains : 3703/3773 places, 506/506 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p3)), true, (OR (NOT p0) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-11
Product exploration explored 100000 steps with 2784 reset in 375 ms.
Product exploration explored 100000 steps with 2767 reset in 387 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 p1 p0 (NOT p3)), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1))))), (X p0), (X p1), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p1))), (X (X (NOT (AND p3 p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1))))]
Knowledge based reduction with 8 factoid took 988 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), true, (NOT p3)]
RANDOM walk for 40000 steps (1069 resets) in 187 ms. (212 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (45 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
// Phase 1: matrix 506 rows 3703 cols
[2025-06-05 16:00:47] [INFO ] Computed 3200 invariants in 511 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/109 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 32/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 270/379 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/445 variables, 64/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 66/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 266/711 variables, 68/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/711 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1320/2031 variables, 1188/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2031 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 33/2064 variables, 1056/2677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2064 variables, 33/2710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2064 variables, 0/2710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1056/3120 variables, 1024/3734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3120 variables, 1056/4790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3120 variables, 0/4790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1089/4209 variables, 1089/5879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4209 variables, 1024/6903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4209 variables, 0/6903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/4209 variables, 0/6903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4209/4209 variables, and 6903 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2295 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3703/3703 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/109 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 32/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 270/379 variables, 134/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/445 variables, 64/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 66/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 266/711 variables, 68/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/711 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1320/2031 variables, 1188/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2031 variables, 0/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 33/2064 variables, 1056/2678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2064 variables, 33/2711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2064 variables, 0/2711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1056/3120 variables, 1024/3735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3120 variables, 1056/4791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3120 variables, 0/4791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1089/4209 variables, 1089/5880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4209 variables, 1024/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4209 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/4209 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4209/4209 variables, and 6904 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2273 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3703/3703 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5100ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0 (NOT p3)), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1))))), (X p0), (X p1), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p1))), (X (X (NOT (AND p3 p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (F p3), (F (NOT (OR (NOT p3) (NOT p1)))), (F (NOT p1)), (F (NOT (AND (NOT p3) p1)))]
Knowledge based reduction with 8 factoid took 1487 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), true, (NOT p3)]
[2025-06-05 16:00:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:01:09] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 16:01:09] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 13636 ms returned unknown
Could not prove EG (NOT p3)
Support contains 34 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 399 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 16:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:01:15] [INFO ] Implicit Places using invariants in 6260 ms returned []
[2025-06-05 16:01:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:01:35] [INFO ] Implicit Places using invariants and state equation in 19828 ms returned []
Implicit Place search using SMT with State Equation took 26094 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 16:01:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60489ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Finished structural reductions in LTL mode , in 1 iterations and 86986 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 p1 (NOT p3)), (X (X p1)), (F (G p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p1))), (X (X (NOT (AND p3 p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1))))]
Knowledge based reduction with 4 factoid took 345 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), true, (NOT p3)]
RANDOM walk for 40000 steps (1073 resets) in 161 ms. (246 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (45 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2025-06-05 16:02:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/109 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 32/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 270/379 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/445 variables, 64/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 66/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 266/711 variables, 68/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/711 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1320/2031 variables, 1188/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2031 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 33/2064 variables, 1056/2677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2064 variables, 33/2710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2064 variables, 0/2710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1056/3120 variables, 1024/3734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3120 variables, 1056/4790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3120 variables, 0/4790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1089/4209 variables, 1089/5879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4209 variables, 1024/6903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4209 variables, 0/6903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/4209 variables, 0/6903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4209/4209 variables, and 6903 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2278 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3703/3703 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/109 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 32/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 270/379 variables, 134/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/445 variables, 64/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 66/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 266/711 variables, 68/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/711 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1320/2031 variables, 1188/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2031 variables, 0/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 33/2064 variables, 1056/2678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2064 variables, 33/2711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2064 variables, 0/2711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1056/3120 variables, 1024/3735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3120 variables, 1056/4791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3120 variables, 0/4791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1089/4209 variables, 1089/5880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4209 variables, 1024/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4209 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/4209 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4209/4209 variables, and 6904 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2017 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3703/3703 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4319ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p3)), (X (X p1)), (F (G p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p1))), (X (X (NOT (AND p3 p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (F p3), (F (NOT (AND p1 (NOT p3)))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p3))))]
Knowledge based reduction with 4 factoid took 421 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), true, (NOT p3)]
[2025-06-05 16:02:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:02:57] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 13476 ms returned sat
[2025-06-05 16:02:57] [INFO ] [Real]Absence check using state equation in 282 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 2766 reset in 340 ms.
Product exploration explored 100000 steps with 2756 reset in 365 ms.
Applying partial POR strategy [true, false, true, true, false]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 34 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 203 are kept as prefixes of interest. Removing 3500 places using SCC suffix rule.6 ms
Discarding 3500 places :
Also discarding 202 output transitions
Drop transitions (Output transitions of discarded places.) removed 202 transitions
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 0 with 164 rules applied. Total rules applied 165 place count 203 transition count 140
Applied a total of 165 rules in 17 ms. Remains 203 /3703 variables (removed 3500) and now considering 140/506 (removed 366) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:02:58] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
// Phase 1: matrix 140 rows 203 cols
[2025-06-05 16:02:58] [INFO ] Computed 64 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 140/342 variables, 202/266 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/343 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 267 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4895 ms.
Refiners :[Generalized P Invariants (flows): 64/64 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 140/342 variables, 202/266 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 105/371 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/343 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 372 constraints, problems are : Problem set: 0 solved, 105 unsolved in 10727 ms.
Refiners :[Generalized P Invariants (flows): 64/64 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15642ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 15643ms
Starting structural reductions in SI_LTL mode, iteration 1 : 203/3703 places, 140/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15674 ms. Remains : 203/3703 places, 140/506 transitions.
Built C files in :
/tmp/ltsmin17865160174976324171
[2025-06-05 16:03:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17865160174976324171
Running compilation step : cd /tmp/ltsmin17865160174976324171;'/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 2304 ms.
Running link step : cd /tmp/ltsmin17865160174976324171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17865160174976324171;'/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/stateBased12061593433350500963.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 34 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 388 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2025-06-05 16:03:30] [INFO ] Computed 3200 invariants in 454 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:03:36] [INFO ] Implicit Places using invariants in 6345 ms returned []
[2025-06-05 16:03:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:03:55] [INFO ] Implicit Places using invariants and state equation in 19590 ms returned []
Implicit Place search using SMT with State Equation took 25938 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 16:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60503ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60506ms
Finished structural reductions in LTL mode , in 1 iterations and 86835 ms. Remains : 3703/3703 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin10753648418499135840
[2025-06-05 16:04:56] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10753648418499135840
Running compilation step : cd /tmp/ltsmin10753648418499135840;'/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 2361 ms.
Running link step : cd /tmp/ltsmin10753648418499135840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10753648418499135840;'/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/stateBased4740430872540916780.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:05:11] [INFO ] Flatten gal took : 81 ms
[2025-06-05 16:05:11] [INFO ] Flatten gal took : 70 ms
[2025-06-05 16:05:11] [INFO ] Time to serialize gal into /tmp/LTL7996091219947091190.gal : 9 ms
[2025-06-05 16:05:11] [INFO ] Time to serialize properties into /tmp/LTL3490861794162809477.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7996091219947091190.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18265069281769529515.hoa' '-atoms' '/tmp/LTL3490861794162809477.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3490861794162809477.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18265069281769529515.hoa
Detected timeout of ITS tools.
[2025-06-05 16:05:26] [INFO ] Flatten gal took : 82 ms
[2025-06-05 16:05:26] [INFO ] Flatten gal took : 69 ms
[2025-06-05 16:05:26] [INFO ] Time to serialize gal into /tmp/LTL16701495108112997326.gal : 8 ms
[2025-06-05 16:05:26] [INFO ] Time to serialize properties into /tmp/LTL14778315532331142374.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16701495108112997326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14778315532331142374.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("(((((((s2_0+s2_1)+(s2_2+s2_3))+((s2_4+s2_5)+(s2_6+s2_7)))+(((s2_8+s2_9)+(s2_10+s2_11))+((s2_12+s2_13)+(s2_14+s2_15))))+((((s2_1...1114
Formula 0 simplified : X(!"(((((((s2_0+s2_1)+(s2_2+s2_3))+((s2_4+s2_5)+(s2_6+s2_7)))+(((s2_8+s2_9)+(s2_10+s2_11))+((s2_12+s2_13)+(s2_14+s2_15))))+((((s2_16...1091
Detected timeout of ITS tools.
[2025-06-05 16:05:41] [INFO ] Flatten gal took : 73 ms
[2025-06-05 16:05:41] [INFO ] Applying decomposition
[2025-06-05 16:05:42] [INFO ] Flatten gal took : 70 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/graph14771394448661707566.txt' '-o' '/tmp/graph14771394448661707566.bin' '-w' '/tmp/graph14771394448661707566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14771394448661707566.bin' '-l' '-1' '-v' '-w' '/tmp/graph14771394448661707566.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:05:42] [INFO ] Decomposing Gal with order
[2025-06-05 16:05:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:05:42] [INFO ] Removed a total of 329 redundant transitions.
[2025-06-05 16:05:42] [INFO ] Flatten gal took : 134 ms
[2025-06-05 16:05:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 58 ms.
[2025-06-05 16:05:42] [INFO ] Time to serialize gal into /tmp/LTL3062269009089157605.gal : 24 ms
[2025-06-05 16:05:42] [INFO ] Time to serialize properties into /tmp/LTL1378323809999970414.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3062269009089157605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1378323809999970414.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...275
Read 1 LTL properties
Checking formula 0 : !((X(("(((((((gu107.s2_0+gu107.s2_1)+(gu107.s2_2+gu107.s2_3))+((gu107.s2_4+gu107.s2_5)+(gu107.s2_6+gu107.s2_7)))+(((gu107.s2_8+gu107.s...2068
Formula 0 simplified : X(!"(((((((gu107.s2_0+gu107.s2_1)+(gu107.s2_2+gu107.s2_3))+((gu107.s2_4+gu107.s2_5)+(gu107.s2_6+gu107.s2_7)))+(((gu107.s2_8+gu107.s2...2026
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-11 finished in 335388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 99 out of 3773 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Graph (complete) has 43441 edges and 3773 vertex of which 3702 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.14 ms
Discarding 71 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 3699 transition count 501
Applied a total of 5 rules in 815 ms. Remains 3699 /3773 variables (removed 74) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2025-06-05 16:05:58] [INFO ] Computed 3200 invariants in 71 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:06:04] [INFO ] Implicit Places using invariants in 6161 ms returned []
[2025-06-05 16:06:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:06:34] [INFO ] Implicit Places using invariants and state equation in 29203 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 35369 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3773 places, 501/506 transitions.
Applied a total of 0 rules in 365 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36549 ms. Remains : 3633/3773 places, 501/506 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-12
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-12 finished in 36664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(X(X(p0))&&(p1 U p2)))))))'
Support contains 1156 out of 3773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 3736 transition count 506
Applied a total of 37 rules in 193 ms. Remains 3736 /3773 variables (removed 37) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2025-06-05 16:06:34] [INFO ] Computed 3232 invariants in 66 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:06:38] [INFO ] Implicit Places using invariants in 3692 ms returned []
[2025-06-05 16:06:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:06:44] [INFO ] Implicit Places using invariants and state equation in 5472 ms returned []
Implicit Place search using SMT with State Equation took 9166 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 16:06: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/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60471ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Starting structural reductions in LTL mode, iteration 1 : 3736/3773 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69837 ms. Remains : 3736/3773 places, 506/506 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-13
Product exploration timeout after 62310 steps with 2910 reset in 10001 ms.
Product exploration timeout after 61660 steps with 2903 reset in 10001 ms.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
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 p2) p1 p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR (AND p2 p0) (AND p1 p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X p0)), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p1)), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 870 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter sensitive) to 8 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1071 resets) in 7731 ms. (5 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 1455 ms. (27 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 2650 ms. (15 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (43 resets) in 2548 ms. (15 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (43 resets) in 2186 ms. (18 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 1202 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 1228 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 341 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 1967 ms. (20 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 1172 ms. (34 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 113725 steps, run visited all 9 properties in 2536 ms. (steps per millisecond=44 )
Probabilistic random walk after 113725 steps, saw 33295 distinct states, run finished after 2540 ms. (steps per millisecond=44 ) properties seen :9
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR (AND p2 p0) (AND p1 p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X p0)), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p1)), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p2 p1))), (F p2), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT p1)), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1)))))]
Knowledge based reduction with 13 factoid took 3441 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter sensitive) to 8 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 364 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 180 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 16:08:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:08:23] [INFO ] Implicit Places using invariants in 3486 ms returned []
[2025-06-05 16:08:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:08:29] [INFO ] Implicit Places using invariants and state equation in 5543 ms returned []
Implicit Place search using SMT with State Equation took 9033 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 16:08:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Finished structural reductions in LTL mode , in 1 iterations and 69708 ms. Remains : 3736/3736 places, 506/506 transitions.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
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 p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 859 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter sensitive) to 8 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1067 resets) in 7010 ms. (5 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (43 resets) in 1153 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 2001 ms. (19 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (42 resets) in 1970 ms. (20 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 1966 ms. (20 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 1218 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 1202 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 396 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (43 resets) in 2065 ms. (19 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 1187 ms. (33 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 113725 steps, run visited all 9 properties in 2535 ms. (steps per millisecond=44 )
Probabilistic random walk after 113725 steps, saw 33295 distinct states, run finished after 2538 ms. (steps per millisecond=44 ) properties seen :9
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p2 p1))), (F p2), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT p1)), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1)))))]
Knowledge based reduction with 13 factoid took 3593 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter sensitive) to 8 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4568 reset in 8451 ms.
Product exploration explored 100000 steps with 4696 reset in 8323 ms.
Built C files in :
/tmp/ltsmin9842335452912689923
[2025-06-05 16:10:01] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9842335452912689923
Running compilation step : cd /tmp/ltsmin9842335452912689923;'/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 2543 ms.
Running link step : cd /tmp/ltsmin9842335452912689923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9842335452912689923;'/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/stateBased14443863251782455833.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 187 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 16:10:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:10:20] [INFO ] Implicit Places using invariants in 3554 ms returned []
[2025-06-05 16:10:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:10:25] [INFO ] Implicit Places using invariants and state equation in 5377 ms returned []
Implicit Place search using SMT with State Equation took 8944 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 16:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60504ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60506ms
Finished structural reductions in LTL mode , in 1 iterations and 69639 ms. Remains : 3736/3736 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin16899659028167382647
[2025-06-05 16:11:26] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16899659028167382647
Running compilation step : cd /tmp/ltsmin16899659028167382647;'/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 2564 ms.
Running link step : cd /tmp/ltsmin16899659028167382647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16899659028167382647;'/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/stateBased17258775798860101221.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:11:41] [INFO ] Flatten gal took : 71 ms
[2025-06-05 16:11:41] [INFO ] Flatten gal took : 84 ms
[2025-06-05 16:11:41] [INFO ] Time to serialize gal into /tmp/LTL10392990188268820471.gal : 9 ms
[2025-06-05 16:11:41] [INFO ] Time to serialize properties into /tmp/LTL4465120525848248868.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/LTL10392990188268820471.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12884719622168629971.hoa' '-atoms' '/tmp/LTL4465120525848248868.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/LTL4465120525848248868.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12884719622168629971.hoa
Detected timeout of ITS tools.
[2025-06-05 16:11:56] [INFO ] Flatten gal took : 71 ms
[2025-06-05 16:11:56] [INFO ] Flatten gal took : 90 ms
[2025-06-05 16:11:56] [INFO ] Time to serialize gal into /tmp/LTL9251192427467496585.gal : 9 ms
[2025-06-05 16:11:56] [INFO ] Time to serialize properties into /tmp/LTL12508795869136847672.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9251192427467496585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12508795869136847672.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_1...20705
Formula 0 simplified : XXG(F!"(((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Cs...20692
Detected timeout of ITS tools.
[2025-06-05 16:12:11] [INFO ] Flatten gal took : 72 ms
[2025-06-05 16:12:11] [INFO ] Applying decomposition
[2025-06-05 16:12:11] [INFO ] Flatten gal took : 72 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/graph10695177801635616956.txt' '-o' '/tmp/graph10695177801635616956.bin' '-w' '/tmp/graph10695177801635616956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10695177801635616956.bin' '-l' '-1' '-v' '-w' '/tmp/graph10695177801635616956.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:12:14] [INFO ] Decomposing Gal with order
[2025-06-05 16:12:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:12:14] [INFO ] Removed a total of 332 redundant transitions.
[2025-06-05 16:12:14] [INFO ] Flatten gal took : 117 ms
[2025-06-05 16:12:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 671 labels/synchronizations in 87 ms.
[2025-06-05 16:12:15] [INFO ] Time to serialize gal into /tmp/LTL15826111984015614657.gal : 20 ms
[2025-06-05 16:12:15] [INFO ] Time to serialize properties into /tmp/LTL947881500119366627.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15826111984015614657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL947881500119366627.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((((((gu101.Cstart_0+gu101.Cstart_1)+(gu101.Cstart_2+gu101.Cstart_3))+((gu101.Cstart_4+gu101.Cstart_5)+(gu101.Cstart_6+g...30448
Formula 0 simplified : XXG(F!"(((((((gu101.Cstart_0+gu101.Cstart_1)+(gu101.Cstart_2+gu101.Cstart_3))+((gu101.Cstart_4+gu101.Cstart_5)+(gu101.Cstart_6+gu101...30435
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-13 finished in 355750 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((G(F((p1 U (p2||G(p1)))))||(p3&&F((p1 U (p2||G(p1)))))))))'
Support contains 1222 out of 3773 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Graph (complete) has 43441 edges and 3773 vertex of which 3735 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.14 ms
Discarding 38 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3733 transition count 502
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 3733 transition count 502
Applied a total of 4 rules in 572 ms. Remains 3733 /3773 variables (removed 40) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3733 cols
[2025-06-05 16:12:30] [INFO ] Computed 3233 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:12:34] [INFO ] Implicit Places using invariants in 3634 ms returned []
[2025-06-05 16:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:12:40] [INFO ] Implicit Places using invariants and state equation in 5947 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 9587 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3667/3773 places, 502/506 transitions.
Applied a total of 0 rules in 173 ms. Remains 3667 /3667 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10332 ms. Remains : 3667/3773 places, 502/506 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-14
Stuttering criterion allowed to conclude after 127 steps with 2 reset in 7 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-14 finished in 10518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 3773 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Graph (complete) has 43441 edges and 3773 vertex of which 3703 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.11 ms
Discarding 70 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 3700 transition count 501
Applied a total of 5 rules in 796 ms. Remains 3700 /3773 variables (removed 73) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3700 cols
[2025-06-05 16:12:41] [INFO ] Computed 3201 invariants in 84 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:12:48] [INFO ] Implicit Places using invariants in 6623 ms returned []
[2025-06-05 16:12:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:13:17] [INFO ] Implicit Places using invariants and state equation in 29504 ms returned [3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3433, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498, 3499]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 36132 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3773 places, 501/506 transitions.
Applied a total of 0 rules in 382 ms. Remains 3634 /3634 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37310 ms. Remains : 3634/3773 places, 501/506 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-15
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-15 finished in 37392 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(((G(F(p0))||(F(p0)&&G(F(p1)))) U X(X(X(p2))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-32-LTLCardinality-00
Stuttering acceptance computed with spot in 497 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 35 out of 3773 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Graph (complete) has 43441 edges and 3773 vertex of which 3704 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.24 ms
Discarding 69 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 3701 transition count 501
Applied a total of 5 rules in 808 ms. Remains 3701 /3773 variables (removed 72) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3701 cols
[2025-06-05 16:13:19] [INFO ] Computed 3202 invariants in 71 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:13:26] [INFO ] Implicit Places using invariants in 6620 ms returned []
[2025-06-05 16:13:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:13:52] [INFO ] Implicit Places using invariants and state equation in 25932 ms returned [3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3433, 3434, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498, 3499, 3500]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 32559 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3635/3773 places, 501/506 transitions.
Applied a total of 0 rules in 370 ms. Remains 3635 /3635 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 33738 ms. Remains : 3635/3773 places, 501/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-00
Product exploration explored 100000 steps with 6726 reset in 435 ms.
Product exploration explored 100000 steps with 6834 reset in 459 ms.
Computed a total of 3635 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3635 transition count 501
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 p0 (NOT p2) (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 13 states, 21 edges and 3 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
RANDOM walk for 40000 steps (987 resets) in 227 ms. (175 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
// Phase 1: matrix 501 rows 3635 cols
[2025-06-05 16:13:54] [INFO ] Computed 3137 invariants in 83 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 231/234 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 495/729 variables, 231/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3403/4132 variables, 3399/3634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4132 variables, 3136/6770 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4132 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/4136 variables, 2/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4136 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/4136 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4136/4136 variables, and 6772 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3635/3635 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 231/234 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 495/729 variables, 231/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3403/4132 variables, 3399/3636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4132 variables, 3136/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4132 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/4136 variables, 2/6774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4136/4136 variables, and 6774 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3635/3635 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7210ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3635/3635 places, 501/501 transitions.
Graph (complete) has 43134 edges and 3635 vertex of which 2546 are kept as prefixes of interest. Removing 1089 places using SCC suffix rule.4 ms
Discarding 1089 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 2546 transition count 431
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 135 place count 2482 transition count 367
Iterating global reduction 1 with 64 rules applied. Total rules applied 199 place count 2482 transition count 367
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 1 with 34 rules applied. Total rules applied 233 place count 2482 transition count 333
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 267 place count 2448 transition count 333
Applied a total of 267 rules in 586 ms. Remains 2448 /3635 variables (removed 1187) and now considering 333/501 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 2448/3635 places, 333/501 transitions.
RANDOM walk for 40000 steps (1008 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 374666 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :1 out of 2
Probabilistic random walk after 374666 steps, saw 86426 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :1
// Phase 1: matrix 333 rows 2448 cols
[2025-06-05 16:14:05] [INFO ] Computed 2115 invariants in 50 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:05] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:06] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/433 variables, 135/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2346/2779 variables, 2311/2479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2779 variables, 2080/4559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2779 variables, 0/4559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2780 variables, 33/4592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2780 variables, 1/4593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2780 variables, 0/4593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2781 variables, 1/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2781 variables, 0/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2781 variables, 0/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2781/2781 variables, and 4594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2792 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2113/2113 constraints, State Equation: 2448/2448 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:14:08] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/433 variables, 135/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2346/2779 variables, 2311/2481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2779 variables, 2080/4561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2779 variables, 0/4561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/2780 variables, 33/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2780 variables, 1/4595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2780 variables, 0/4595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2781 variables, 1/4596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2781 variables, 0/4596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2781 variables, 0/4596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2781/2781 variables, and 4596 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2113/2113 constraints, State Equation: 2448/2448 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4542ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 114 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F p2), (F (NOT (OR p2 p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 409 ms. Reduced automaton from 11 states, 16 edges and 2 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 399 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
// Phase 1: matrix 501 rows 3635 cols
[2025-06-05 16:14:11] [INFO ] Computed 3137 invariants in 69 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:14:12] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-06-05 16:14:26] [INFO ] [Real]Absence check using 1 positive and 3136 generalized place invariants in 13471 ms returned sat
[2025-06-05 16:14:26] [INFO ] [Real]Absence check using state equation in 445 ms returned unknown
Could not prove EG (NOT p2)
Support contains 2 out of 3635 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3635/3635 places, 501/501 transitions.
Applied a total of 0 rules in 345 ms. Remains 3635 /3635 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2025-06-05 16:14:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:14:33] [INFO ] Implicit Places using invariants in 6046 ms returned []
[2025-06-05 16:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:15:01] [INFO ] Implicit Places using invariants and state equation in 28541 ms returned []
Implicit Place search using SMT with State Equation took 34590 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-06-05 16:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3600/4136 variables, and 3136 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3635 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3600/4136 variables, and 3136 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3635 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60516ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60519ms
Finished structural reductions in LTL mode , in 1 iterations and 95459 ms. Remains : 3635/3635 places, 501/501 transitions.
Computed a total of 3635 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3635 transition count 501
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 p0 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 11 states, 16 edges and 2 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 416 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
RANDOM walk for 40000 steps (986 resets) in 236 ms. (168 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
[2025-06-05 16:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 231/234 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 495/729 variables, 231/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3403/4132 variables, 3399/3634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4132 variables, 3136/6770 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4132 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/4136 variables, 2/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4136 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/4136 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4136/4136 variables, and 6772 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2089 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3635/3635 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 231/234 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 495/729 variables, 231/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3403/4132 variables, 3399/3636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4132 variables, 3136/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4132 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/4136 variables, 2/6774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4136/4136 variables, and 6774 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3635/3635 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7109ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3635/3635 places, 501/501 transitions.
Graph (complete) has 43134 edges and 3635 vertex of which 2546 are kept as prefixes of interest. Removing 1089 places using SCC suffix rule.9 ms
Discarding 1089 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 2546 transition count 431
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 135 place count 2482 transition count 367
Iterating global reduction 1 with 64 rules applied. Total rules applied 199 place count 2482 transition count 367
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 1 with 34 rules applied. Total rules applied 233 place count 2482 transition count 333
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 267 place count 2448 transition count 333
Applied a total of 267 rules in 538 ms. Remains 2448 /3635 variables (removed 1187) and now considering 333/501 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 2448/3635 places, 333/501 transitions.
RANDOM walk for 40000 steps (1006 resets) in 220 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 374201 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :1 out of 2
Probabilistic random walk after 374201 steps, saw 86376 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :1
// Phase 1: matrix 333 rows 2448 cols
[2025-06-05 16:16:14] [INFO ] Computed 2115 invariants in 48 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/433 variables, 135/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2346/2779 variables, 2311/2479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2779 variables, 2080/4559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2779 variables, 0/4559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2780 variables, 33/4592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2780 variables, 1/4593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2780 variables, 0/4593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2781 variables, 1/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2781 variables, 0/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2781 variables, 0/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2781/2781 variables, and 4594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2674 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2113/2113 constraints, State Equation: 2448/2448 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:16] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/433 variables, 135/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2346/2779 variables, 2311/2481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2779 variables, 2080/4561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2779 variables, 0/4561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/2780 variables, 33/4594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2780 variables, 1/4595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2780 variables, 0/4595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2781 variables, 1/4596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2781 variables, 0/4596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2781 variables, 0/4596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2781/2781 variables, and 4596 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1716 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2113/2113 constraints, State Equation: 2448/2448 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4447ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 130 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 11 states, 16 edges and 2 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 433 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 451 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
// Phase 1: matrix 501 rows 3635 cols
[2025-06-05 16:16:19] [INFO ] Computed 3137 invariants in 77 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:16:20] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-06-05 16:16:34] [INFO ] [Real]Absence check using 1 positive and 3136 generalized place invariants in 13422 ms returned sat
[2025-06-05 16:16:34] [INFO ] [Real]Absence check using state equation in 488 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 442 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 17083 reset in 565 ms.
Product exploration explored 100000 steps with 17098 reset in 600 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Support contains 2 out of 3635 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3635/3635 places, 501/501 transitions.
Applied a total of 0 rules in 382 ms. Remains 3635 /3635 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:16:37] [INFO ] Redundant transitions in 76 ms returned []
Running 434 sub problems to find dead transitions.
[2025-06-05 16:16:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3600/4136 variables, and 3136 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3635 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3600/4136 variables, and 3136 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3635 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60521ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60524ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60994 ms. Remains : 3635/3635 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin16892794046712408491
[2025-06-05 16:17:37] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16892794046712408491
Running compilation step : cd /tmp/ltsmin16892794046712408491;'/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 2291 ms.
Running link step : cd /tmp/ltsmin16892794046712408491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16892794046712408491;'/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/stateBased2764351462234588831.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 3635 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3635/3635 places, 501/501 transitions.
Applied a total of 0 rules in 347 ms. Remains 3635 /3635 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2025-06-05 16:17:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:17:59] [INFO ] Implicit Places using invariants in 5973 ms returned []
[2025-06-05 16:17:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:18:26] [INFO ] Implicit Places using invariants and state equation in 27330 ms returned []
Implicit Place search using SMT with State Equation took 33306 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-06-05 16:18:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3600/4136 variables, and 3136 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3635 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3600/4136 variables, and 3136 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3635 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60529ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60531ms
Finished structural reductions in LTL mode , in 1 iterations and 94191 ms. Remains : 3635/3635 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin18117168728987146888
[2025-06-05 16:19:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18117168728987146888
Running compilation step : cd /tmp/ltsmin18117168728987146888;'/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 2336 ms.
Running link step : cd /tmp/ltsmin18117168728987146888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18117168728987146888;'/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/stateBased10493211259776190285.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:19:42] [INFO ] Flatten gal took : 63 ms
[2025-06-05 16:19:42] [INFO ] Flatten gal took : 63 ms
[2025-06-05 16:19:42] [INFO ] Time to serialize gal into /tmp/LTL16584806018738838041.gal : 9 ms
[2025-06-05 16:19:42] [INFO ] Time to serialize properties into /tmp/LTL14094136127633046887.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16584806018738838041.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11766546392130635244.hoa' '-atoms' '/tmp/LTL14094136127633046887.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14094136127633046887.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11766546392130635244.hoa
Detected timeout of ITS tools.
[2025-06-05 16:19:57] [INFO ] Flatten gal took : 79 ms
[2025-06-05 16:19:57] [INFO ] Flatten gal took : 63 ms
[2025-06-05 16:19:57] [INFO ] Time to serialize gal into /tmp/LTL15862955748167676227.gal : 9 ms
[2025-06-05 16:19:57] [INFO ] Time to serialize properties into /tmp/LTL9527457304138605977.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15862955748167676227.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9527457304138605977.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 : !((G(((G(F("(CstopAbort<2)")))||((F("(CstopAbort<2)"))&&(G(F("(((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sst...508
Formula 0 simplified : F((FG!"(CstopAbort<2)" & (G!"(CstopAbort<2)" | FG!"(((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sstart_6+Sst...489
Detected timeout of ITS tools.
[2025-06-05 16:20:12] [INFO ] Flatten gal took : 63 ms
[2025-06-05 16:20:12] [INFO ] Applying decomposition
[2025-06-05 16:20:12] [INFO ] Flatten gal took : 99 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/graph6904166402472167683.txt' '-o' '/tmp/graph6904166402472167683.bin' '-w' '/tmp/graph6904166402472167683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6904166402472167683.bin' '-l' '-1' '-v' '-w' '/tmp/graph6904166402472167683.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:20:13] [INFO ] Decomposing Gal with order
[2025-06-05 16:20:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:20:13] [INFO ] Removed a total of 152 redundant transitions.
[2025-06-05 16:20:13] [INFO ] Flatten gal took : 176 ms
[2025-06-05 16:20:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 22 ms.
[2025-06-05 16:20:13] [INFO ] Time to serialize gal into /tmp/LTL5832904404685330783.gal : 13 ms
[2025-06-05 16:20:13] [INFO ] Time to serialize properties into /tmp/LTL18387821912674036384.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5832904404685330783.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18387821912674036384.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 : !((G(((G(F("(gi0.gu0.CstopAbort<2)")))||((F("(gi0.gu0.CstopAbort<2)"))&&(G(F("(((((((gu16.Sstart_0+gu16.Sstart_1)+(gu16.Sstart_2+gu16....697
Formula 0 simplified : F((FG!"(gi0.gu0.CstopAbort<2)" & (G!"(gi0.gu0.CstopAbort<2)" | FG!"(((((((gu16.Sstart_0+gu16.Sstart_1)+(gu16.Sstart_2+gu16.Sstart_3)...678
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-00 finished in 430285 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((F(p1)&&X(p2))))))'
Found a Shortening insensitive property : QuasiCertifProtocol-COL-32-LTLCardinality-07
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 1094 out of 3773 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3773/3773 places, 506/506 transitions.
Graph (complete) has 43441 edges and 3773 vertex of which 3738 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.14 ms
Discarding 35 places :
Also discarding 0 output 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 3737 transition count 505
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 3737 transition count 505
Applied a total of 4 rules in 611 ms. Remains 3737 /3773 variables (removed 36) and now considering 505/506 (removed 1) transitions.
// Phase 1: matrix 505 rows 3737 cols
[2025-06-05 16:20:29] [INFO ] Computed 3233 invariants in 64 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:20:33] [INFO ] Implicit Places using invariants in 3605 ms returned []
[2025-06-05 16:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:20:39] [INFO ] Implicit Places using invariants and state equation in 5961 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 9572 ms to find 33 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3704/3773 places, 505/506 transitions.
Applied a total of 0 rules in 211 ms. Remains 3704 /3704 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 10394 ms. Remains : 3704/3773 places, 505/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-07
Product exploration explored 100000 steps with 4936 reset in 1441 ms.
Product exploration explored 100000 steps with 4903 reset in 1483 ms.
Computed a total of 3704 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 505
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) p1 (NOT p2)), (X p1), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 464 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (1065 resets) in 2193 ms. (18 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (43 resets) in 1010 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (34 resets) in 1050 ms. (38 steps per ms) remains 2/2 properties
// Phase 1: matrix 505 rows 3704 cols
[2025-06-05 16:20:44] [INFO ] Computed 3200 invariants in 35 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/1125 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1056/2181 variables, 1024/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2181 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 333/2514 variables, 2181/4261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2514 variables, 0/4261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 465/2979 variables, 299/4560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2979 variables, 32/4592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2979 variables, 0/4592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1227/4206 variables, 1222/5814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4206 variables, 1088/6902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4206 variables, 0/6902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/4209 variables, 2/6904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4209 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4209 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4209/4209 variables, and 6904 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2530 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3704/3704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/1125 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1056/2181 variables, 1024/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2181 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2514/4209 variables, and 4261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3176 ms.
Refiners :[Generalized P Invariants (flows): 2080/3200 constraints, State Equation: 2181/3704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5770ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1092 out of 3704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3704/3704 places, 505/505 transitions.
Graph (complete) has 42081 edges and 3704 vertex of which 2614 are kept as prefixes of interest. Removing 1090 places using SCC suffix rule.9 ms
Discarding 1090 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 2614 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 71 place count 2614 transition count 434
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 2613 transition count 434
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 138 place count 2548 transition count 369
Iterating global reduction 1 with 65 rules applied. Total rules applied 203 place count 2548 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 2547 transition count 368
Applied a total of 204 rules in 236 ms. Remains 2547 /3704 variables (removed 1157) and now considering 368/505 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 2547/3704 places, 368/505 transitions.
RANDOM walk for 40000 steps (1010 resets) in 2520 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 1092 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 1125 ms. (35 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 6937 steps, run visited all 2 properties in 374 ms. (steps per millisecond=18 )
Probabilistic random walk after 6937 steps, saw 6804 distinct states, run finished after 378 ms. (steps per millisecond=18 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p1), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p2), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 732 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
[2025-06-05 16:20:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:21:08] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 13886 ms returned unknown
Could not prove EG (NOT p2)
Support contains 1092 out of 3704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3704/3704 places, 505/505 transitions.
Applied a total of 0 rules in 185 ms. Remains 3704 /3704 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-06-05 16:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:21:12] [INFO ] Implicit Places using invariants in 3574 ms returned []
[2025-06-05 16:21:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:21:18] [INFO ] Implicit Places using invariants and state equation in 5862 ms returned []
Implicit Place search using SMT with State Equation took 9442 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2025-06-05 16:21:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3701 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3701/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3704 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3701 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3701/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3704 constraints, PredecessorRefiner: 0/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60512ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Finished structural reductions in LTL mode , in 1 iterations and 70144 ms. Remains : 3704/3704 places, 505/505 transitions.
Computed a total of 3704 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 505
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 p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 160 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (1069 resets) in 1965 ms. (20 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 1024 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (49 resets) in 976 ms. (40 steps per ms) remains 2/2 properties
[2025-06-05 16:22:21] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/1125 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1056/2181 variables, 1024/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2181 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2514/4209 variables, and 4261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2946 ms.
Refiners :[Generalized P Invariants (flows): 2080/3200 constraints, State Equation: 2181/3704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/1125 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1125 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1056/2181 variables, 1024/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2181 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2514/4209 variables, and 4261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3275 ms.
Refiners :[Generalized P Invariants (flows): 2080/3200 constraints, State Equation: 2181/3704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6249ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1092 out of 3704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3704/3704 places, 505/505 transitions.
Graph (complete) has 42081 edges and 3704 vertex of which 2614 are kept as prefixes of interest. Removing 1090 places using SCC suffix rule.3 ms
Discarding 1090 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 2614 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 71 place count 2614 transition count 434
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 2613 transition count 434
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 138 place count 2548 transition count 369
Iterating global reduction 1 with 65 rules applied. Total rules applied 203 place count 2548 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 2547 transition count 368
Applied a total of 204 rules in 221 ms. Remains 2547 /3704 variables (removed 1157) and now considering 368/505 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 2547/3704 places, 368/505 transitions.
RANDOM walk for 40000 steps (1009 resets) in 1738 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 881 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (25 resets) in 881 ms. (45 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 6937 steps, run visited all 2 properties in 422 ms. (steps per millisecond=16 )
Probabilistic random walk after 6937 steps, saw 6804 distinct states, run finished after 425 ms. (steps per millisecond=16 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
[2025-06-05 16:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:22:44] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 13834 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 3998 reset in 2007 ms.
Product exploration explored 100000 steps with 4012 reset in 2038 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Support contains 1092 out of 3704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3704/3704 places, 505/505 transitions.
Graph (complete) has 42081 edges and 3704 vertex of which 3703 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 214 ms. Remains 3703 /3704 variables (removed 1) and now considering 505/505 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:22:49] [INFO ] Redundant transitions in 23 ms returned []
Running 471 sub problems to find dead transitions.
// Phase 1: matrix 505 rows 3703 cols
[2025-06-05 16:22:49] [INFO ] Computed 3200 invariants in 66 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3701 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3701/4208 variables, and 3200 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3701 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3701/4208 variables, and 3200 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60563ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60565ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3703/3704 places, 505/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60822 ms. Remains : 3703/3704 places, 505/505 transitions.
Built C files in :
/tmp/ltsmin3368125159585891115
[2025-06-05 16:23:49] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3368125159585891115
Running compilation step : cd /tmp/ltsmin3368125159585891115;'/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 2409 ms.
Running link step : cd /tmp/ltsmin3368125159585891115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3368125159585891115;'/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/stateBased1608345489829434214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1092 out of 3704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3704/3704 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3703 transition count 505
Applied a total of 1 rules in 189 ms. Remains 3703 /3704 variables (removed 1) and now considering 505/505 (removed 0) transitions.
[2025-06-05 16:24:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:24:08] [INFO ] Implicit Places using invariants in 3669 ms returned []
[2025-06-05 16:24:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:24:14] [INFO ] Implicit Places using invariants and state equation in 5952 ms returned []
Implicit Place search using SMT with State Equation took 9622 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2025-06-05 16:24:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3701 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3701/4208 variables, and 3200 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3701 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3701/4208 variables, and 3200 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60447ms
Starting structural reductions in LTL mode, iteration 1 : 3703/3704 places, 505/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70261 ms. Remains : 3703/3704 places, 505/505 transitions.
Built C files in :
/tmp/ltsmin5106436462249458675
[2025-06-05 16:25:15] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5106436462249458675
Running compilation step : cd /tmp/ltsmin5106436462249458675;'/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 2428 ms.
Running link step : cd /tmp/ltsmin5106436462249458675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5106436462249458675;'/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/stateBased17306734213057625778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:25:30] [INFO ] Flatten gal took : 70 ms
[2025-06-05 16:25:30] [INFO ] Flatten gal took : 70 ms
[2025-06-05 16:25:30] [INFO ] Time to serialize gal into /tmp/LTL17711649495619992087.gal : 10 ms
[2025-06-05 16:25:30] [INFO ] Time to serialize properties into /tmp/LTL872836039247977654.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17711649495619992087.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6639645857893389157.hoa' '-atoms' '/tmp/LTL872836039247977654.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL872836039247977654.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6639645857893389157.hoa
Detected timeout of ITS tools.
[2025-06-05 16:25:45] [INFO ] Flatten gal took : 87 ms
[2025-06-05 16:25:45] [INFO ] Flatten gal took : 77 ms
[2025-06-05 16:25:45] [INFO ] Time to serialize gal into /tmp/LTL8257407675957350621.gal : 9 ms
[2025-06-05 16:25:45] [INFO ] Time to serialize properties into /tmp/LTL3496368441326204132.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8257407675957350621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3496368441326204132.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...275
Read 1 LTL properties
Checking formula 0 : !(((F("(Astart<=CstopAbort)"))&&(X(F((F("((((((((((((n8_0+n8_1)+(n8_2+n8_3))+((n8_4+n8_5)+(n8_6+n8_7)))+(((n8_8+n8_9)+(n8_10+n8_11))+(...9892
Formula 0 simplified : G!"(Astart<=CstopAbort)" | XG(G!"((((((((((((n8_0+n8_1)+(n8_2+n8_3))+((n8_4+n8_5)+(n8_6+n8_7)))+(((n8_8+n8_9)+(n8_10+n8_11))+((n8_12...9878
Detected timeout of ITS tools.
[2025-06-05 16:26:00] [INFO ] Flatten gal took : 70 ms
[2025-06-05 16:26:00] [INFO ] Applying decomposition
[2025-06-05 16:26:00] [INFO ] Flatten gal took : 78 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/graph6505198939372260986.txt' '-o' '/tmp/graph6505198939372260986.bin' '-w' '/tmp/graph6505198939372260986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6505198939372260986.bin' '-l' '-1' '-v' '-w' '/tmp/graph6505198939372260986.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:26:02] [INFO ] Decomposing Gal with order
[2025-06-05 16:26:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:26:02] [INFO ] Removed a total of 357 redundant transitions.
[2025-06-05 16:26:02] [INFO ] Flatten gal took : 131 ms
[2025-06-05 16:26:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 334 labels/synchronizations in 65 ms.
[2025-06-05 16:26:03] [INFO ] Time to serialize gal into /tmp/LTL11040380506379870082.gal : 24 ms
[2025-06-05 16:26:03] [INFO ] Time to serialize properties into /tmp/LTL2116550014904969244.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11040380506379870082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2116550014904969244.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gi1.gi0.gi0.gi7.gu0.Astart<=gi1.gi0.gi0.gi7.gu0.CstopAbort)"))&&(X(F((F("((((((((((((gu1.n8_0+gu1.n8_1)+(gu1.n8_2+gu1.n8_3))+(...14336
Formula 0 simplified : G!"(gi1.gi0.gi0.gi7.gu0.Astart<=gi1.gi0.gi0.gi7.gu0.CstopAbort)" | XG(G!"((((((((((((gu1.n8_0+gu1.n8_1)+(gu1.n8_2+gu1.n8_3))+((gu1.n...14322
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-07 finished in 349610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G((p1&&X((p1 U (p2||G(p1)))))) U p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(X(X(p0))&&(p1 U p2)))))))'
[2025-06-05 16:26:18] [INFO ] Flatten gal took : 79 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2872603200610195291
[2025-06-05 16:26:18] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2025-06-05 16:26:18] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:26:18] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2025-06-05 16:26:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:26:18] [INFO ] Applying decomposition
[2025-06-05 16:26:18] [INFO ] Flatten gal took : 82 ms
[2025-06-05 16:26:18] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2025-06-05 16:26:18] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:26:18] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2872603200610195291
Running compilation step : cd /tmp/ltsmin2872603200610195291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' '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 3211 ms.
Running link step : cd /tmp/ltsmin2872603200610195291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2872603200610195291;'/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' '[]((([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](<>((LTLAPp1==true))))) U X(X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
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/graph8521749475424976846.txt' '-o' '/tmp/graph8521749475424976846.bin' '-w' '/tmp/graph8521749475424976846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8521749475424976846.bin' '-l' '-1' '-v' '-w' '/tmp/graph8521749475424976846.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:26:22] [INFO ] Decomposing Gal with order
[2025-06-05 16:26:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:26:23] [INFO ] Removed a total of 393 redundant transitions.
[2025-06-05 16:26:23] [INFO ] Flatten gal took : 338 ms
[2025-06-05 16:26:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 445 labels/synchronizations in 57 ms.
[2025-06-05 16:26:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality2779057999234634478.gal : 49 ms
[2025-06-05 16:26:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality17476818909503278044.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2779057999234634478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17476818909503278044.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...298
Read 5 LTL properties
Checking formula 0 : !((G(((G(F("(gi6.gu89.CstopAbort<2)")))||((F("(gi6.gu89.CstopAbort<2)"))&&(G(F("(((((((gu71.Sstart_0+gu71.Sstart_1)+(gu71.Sstart_2+gu7...704
Formula 0 simplified : F((FG!"(gi6.gu89.CstopAbort<2)" & (G!"(gi6.gu89.CstopAbort<2)" | FG!"(((((((gu71.Sstart_0+gu71.Sstart_1)+(gu71.Sstart_2+gu71.Sstart_...685
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.053: LTL layer: formula: []((([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](<>((LTLAPp1==true))))) U X(X(X((LTLAPp2==true))))))
pins2lts-mc-linux64( 5/ 8), 0.053: "[]((([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](<>((LTLAPp1==true))))) U X(X(X((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.054: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.093: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.478: DFS-FIFO for weak LTL, using special progress label 520
pins2lts-mc-linux64( 0/ 8), 0.478: There are 521 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.478: State length is 3774, there are 520 groups
pins2lts-mc-linux64( 0/ 8), 0.478: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.478: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.478: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.478: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.834: ~1 levels ~960 states ~22104 transitions
pins2lts-mc-linux64( 5/ 8), 0.942: ~1 levels ~1920 states ~22104 transitions
pins2lts-mc-linux64( 5/ 8), 1.232: ~1 levels ~3840 states ~39000 transitions
pins2lts-mc-linux64( 7/ 8), 1.814: ~1 levels ~7680 states ~104032 transitions
pins2lts-mc-linux64( 7/ 8), 3.746: ~1 levels ~15360 states ~471072 transitions
pins2lts-mc-linux64( 7/ 8), 6.225: ~1 levels ~30720 states ~969760 transitions
pins2lts-mc-linux64( 7/ 8), 10.888: ~1 levels ~61440 states ~1809432 transitions
pins2lts-mc-linux64( 2/ 8), 20.193: ~1 levels ~122880 states ~3830064 transitions
pins2lts-mc-linux64( 2/ 8), 45.623: ~1 levels ~245760 states ~10848744 transitions
pins2lts-mc-linux64( 3/ 8), 82.158: ~1 levels ~491520 states ~17973616 transitions
pins2lts-mc-linux64( 4/ 8), 102.820: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 104.326:
pins2lts-mc-linux64( 0/ 8), 104.326: mean standard work distribution: 13.2% (states) 5.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 104.326:
pins2lts-mc-linux64( 0/ 8), 104.326: Explored 510721 states 24395762 transitions, fanout: 47.767
pins2lts-mc-linux64( 0/ 8), 104.326: Total exploration time 103.830 sec (102.450 sec minimum, 103.018 sec on average)
pins2lts-mc-linux64( 0/ 8), 104.326: States per second: 4919, Transitions per second: 234959
pins2lts-mc-linux64( 0/ 8), 104.326:
pins2lts-mc-linux64( 0/ 8), 104.326: Progress states detected: 8327761
pins2lts-mc-linux64( 0/ 8), 104.326: Redundant explorations: -93.8675
pins2lts-mc-linux64( 0/ 8), 104.326:
pins2lts-mc-linux64( 0/ 8), 104.326: Queue width: 8B, total height: 10515792, memory: 80.23MB
pins2lts-mc-linux64( 0/ 8), 104.326: Tree memory: 319.5MB, 40.2 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 104.326: Tree fill ratio (roots/leafs): 6.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 104.326: Stored 509 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 104.326: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 104.326: Est. total memory use: 399.8MB (~1104.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2872603200610195291;'/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' '[]((([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](<>((LTLAPp1==true))))) U X(X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2872603200610195291;'/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' '[]((([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](<>((LTLAPp1==true))))) U X(X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-32, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254600771"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;