About the Execution of ITS-Tools for HirschbergSinclair-PT-20
| 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 | FTFFFF?TTTFTFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422000083.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 HirschbergSinclair-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422000083
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 284K 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 HirschbergSinclair-PT-20-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748777036453
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 11:23:57] [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-01 11:23:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:23:58] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-01 11:23:58] [INFO ] Transformed 530 places.
[2025-06-01 11:23:58] [INFO ] Transformed 485 transitions.
[2025-06-01 11:23:58] [INFO ] Parsed PT model containing 530 places and 485 transitions and 1479 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 485/485 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 512 transition count 485
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 498 transition count 471
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 498 transition count 471
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 486 transition count 459
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 486 transition count 459
Applied a total of 70 rules in 139 ms. Remains 486 /530 variables (removed 44) and now considering 459/485 (removed 26) transitions.
// Phase 1: matrix 459 rows 486 cols
[2025-06-01 11:23:58] [INFO ] Computed 27 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:23:59] [INFO ] Implicit Places using invariants in 646 ms returned []
[2025-06-01 11:23:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:24:06] [INFO ] Implicit Places using invariants and state equation in 6962 ms returned []
Implicit Place search using SMT with State Equation took 7653 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2025-06-01 11:24:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 22/486 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:24:20] [INFO ] Deduced a trap composed of 191 places in 192 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:24:21] [INFO ] Deduced a trap composed of 191 places in 155 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 439 unsolved
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 30183ms
Starting structural reductions in LTL mode, iteration 1 : 486/530 places, 459/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38001 ms. Remains : 486/530 places, 459/485 transitions.
Support contains 41 out of 486 places after structural reductions.
[2025-06-01 11:24:36] [INFO ] Flatten gal took : 68 ms
[2025-06-01 11:24:36] [INFO ] Flatten gal took : 36 ms
[2025-06-01 11:24:36] [INFO ] Input system was already deterministic with 459 transitions.
RANDOM walk for 40000 steps (80 resets) in 1809 ms. (22 steps per ms) remains 13/28 properties
BEST_FIRST walk for 40002 steps (9 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 228 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (11 resets) in 197 ms. (202 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (12 resets) in 145 ms. (274 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (9 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (12 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
[2025-06-01 11:24:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 395/410 variables, 23/23 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/23 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 34/444 variables, 4/27 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/27 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 5 (OVERLAPS) 459/903 variables, 444/471 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/471 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/945 variables, 42/513 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/945 variables, 0/513 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/945 variables, 0/513 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 945/945 variables, and 513 constraints, problems are : Problem set: 11 solved, 1 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/406 variables, 22/22 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/409 variables, 1/23 constraints. Problems are: Problem set: 11 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:24:38] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:24:38] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:24:39] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:24:39] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:24:39] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 5/28 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/28 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/443 variables, 4/32 constraints. Problems are: Problem set: 11 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:24:39] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 1/33 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/33 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 459/902 variables, 443/476 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 1/477 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 0/477 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 43/945 variables, 43/520 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/945 variables, 0/520 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/945 variables, 0/520 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 945/945 variables, and 520 constraints, problems are : Problem set: 11 solved, 1 unsolved in 1333 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 1/12 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2186ms problems are : Problem set: 11 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 459/459 transitions.
Graph (complete) has 922 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 485 transition count 259
Reduce places removed 200 places and 0 transitions.
Graph (complete) has 499 edges and 285 vertex of which 248 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 202 rules applied. Total rules applied 403 place count 248 transition count 258
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 441 place count 247 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 443 place count 245 transition count 219
Iterating global reduction 3 with 2 rules applied. Total rules applied 445 place count 245 transition count 219
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 3 with 2 rules applied. Total rules applied 447 place count 245 transition count 217
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 426 edges and 243 vertex of which 239 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 450 place count 239 transition count 217
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 454 place count 239 transition count 213
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 474 place count 239 transition count 193
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 494 place count 219 transition count 193
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 514 place count 199 transition count 173
Applied a total of 514 rules in 60 ms. Remains 199 /486 variables (removed 287) and now considering 173/459 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 199/486 places, 173/459 transitions.
RANDOM walk for 40000 steps (232 resets) in 905 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (80 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7297 steps, run visited all 1 properties in 40 ms. (steps per millisecond=182 )
Probabilistic random walk after 7297 steps, saw 2257 distinct states, run finished after 43 ms. (steps per millisecond=169 ) properties seen :1
FORMULA HirschbergSinclair-PT-20-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 486 stabilizing places and 459 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 486 transition count 459
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-20-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(X(p1))) U (G((p0&&X(X(p1))))||(p0&&X(X(p2))))))'
Support contains 5 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 459/459 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 484 transition count 459
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 477 transition count 452
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 477 transition count 452
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 471 transition count 446
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 471 transition count 446
Applied a total of 28 rules in 32 ms. Remains 471 /486 variables (removed 15) and now considering 446/459 (removed 13) transitions.
// Phase 1: matrix 446 rows 471 cols
[2025-06-01 11:24:40] [INFO ] Computed 25 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:24:41] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-06-01 11:24:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:24:47] [INFO ] Implicit Places using invariants and state equation in 6853 ms returned []
Implicit Place search using SMT with State Equation took 7087 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-01 11:24:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/917 variables, and 496 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 426/922 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/917 variables, and 922 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 471/486 places, 446/459 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67247 ms. Remains : 471/486 places, 446/459 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-00 finished in 67662 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 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 459/459 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 485 transition count 459
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 478 transition count 452
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 478 transition count 452
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 473 transition count 447
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 473 transition count 447
Applied a total of 25 rules in 32 ms. Remains 473 /486 variables (removed 13) and now considering 447/459 (removed 12) transitions.
// Phase 1: matrix 447 rows 473 cols
[2025-06-01 11:25:48] [INFO ] Computed 26 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:25:48] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-06-01 11:25:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:25:56] [INFO ] Implicit Places using invariants and state equation in 7353 ms returned []
Implicit Place search using SMT with State Equation took 7725 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-06-01 11:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 21/473 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:26:09] [INFO ] Deduced a trap composed of 191 places in 142 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:26:10] [INFO ] Deduced a trap composed of 191 places in 141 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 447/920 variables, 473/501 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 920/920 variables, and 501 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 21/473 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 447/920 variables, 473/501 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/920 variables, 427/928 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 920/920 variables, and 928 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 447/459 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67841 ms. Remains : 473/486 places, 447/459 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-02 finished in 67984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G((!p0 U (p1||X(p1)))))))'
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 459/459 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 484 transition count 459
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 476 transition count 451
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 476 transition count 451
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 471 transition count 446
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 471 transition count 446
Applied a total of 28 rules in 38 ms. Remains 471 /486 variables (removed 15) and now considering 446/459 (removed 13) transitions.
// Phase 1: matrix 446 rows 471 cols
[2025-06-01 11:26:56] [INFO ] Computed 25 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:26:56] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-01 11:26:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:27:03] [INFO ] Implicit Places using invariants and state equation in 6951 ms returned []
Implicit Place search using SMT with State Equation took 7152 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-01 11:27:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/917 variables, and 496 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 426/922 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/917 variables, and 922 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 471/486 places, 446/459 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67281 ms. Remains : 471/486 places, 446/459 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-06
Product exploration explored 100000 steps with 290 reset in 341 ms.
Product exploration explored 100000 steps with 276 reset in 309 ms.
Computed a total of 471 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 471 transition count 446
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), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 199 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (80 resets) in 319 ms. (125 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 154 ms. (258 steps per ms) remains 1/2 properties
[2025-06-01 11:28:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 413/417 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/434 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 446/880 variables, 434/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/880 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/917 variables, 37/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/917 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/917 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 917/917 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 413/417 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/434 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 880/917 variables, and 459 constraints, problems are : Problem set: 1 solved, 0 unsolved in 245 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 434/471 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 603ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 422 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 446/446 transitions.
Applied a total of 0 rules in 14 ms. Remains 471 /471 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2025-06-01 11:28:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:28:06] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-06-01 11:28:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:28:13] [INFO ] Implicit Places using invariants and state equation in 6953 ms returned []
Implicit Place search using SMT with State Equation took 7149 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-01 11:28:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/917 variables, and 496 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 426/922 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/917 variables, and 922 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Finished structural reductions in LTL mode , in 1 iterations and 67251 ms. Remains : 471/471 places, 446/446 transitions.
Computed a total of 471 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 471 transition count 446
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), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 39047 steps (78 resets) in 175 ms. (221 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 282 reset in 227 ms.
Product exploration explored 100000 steps with 279 reset in 237 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 446/446 transitions.
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 471 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 187 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 187 place count 471 transition count 446
Deduced a syphon composed of 187 places in 1 ms
Applied a total of 187 rules in 77 ms. Remains 471 /471 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:29:16] [INFO ] Redundant transitions in 24 ms returned []
Running 426 sub problems to find dead transitions.
// Phase 1: matrix 446 rows 471 cols
[2025-06-01 11:29:16] [INFO ] Computed 25 invariants in 2 ms
[2025-06-01 11:29:16] [INFO ] State equation strengthened by 188 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 187 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 188/684 constraints. Problems are: Problem set: 187 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/917 variables, and 684 constraints, problems are : Problem set: 187 solved, 239 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 187 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 187 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 207/471 variables, 25/25 constraints. Problems are: Problem set: 187 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 187 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 187 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 188/684 constraints. Problems are: Problem set: 187 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/917 variables, and 923 constraints, problems are : Problem set: 187 solved, 239 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 239/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 187 solved, 239 unsolved
Search for dead transitions found 187 dead transitions in 60111ms
Found 187 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 187 transitions
Dead transitions reduction (with SMT) removed 187 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 471/471 places, 259/446 transitions.
Graph (complete) has 714 edges and 471 vertex of which 284 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.2 ms
Discarding 187 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 284 /471 variables (removed 187) and now considering 259/259 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 284/471 places, 259/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60258 ms. Remains : 284/471 places, 259/446 transitions.
Built C files in :
/tmp/ltsmin5929587039525386818
[2025-06-01 11:30:16] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5929587039525386818
Running compilation step : cd /tmp/ltsmin5929587039525386818;'/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 818 ms.
Running link step : cd /tmp/ltsmin5929587039525386818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5929587039525386818;'/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/stateBased2642560298587400112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 446/446 transitions.
Applied a total of 0 rules in 21 ms. Remains 471 /471 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 471 cols
[2025-06-01 11:30:31] [INFO ] Computed 25 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:30:31] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-01 11:30:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:30:38] [INFO ] Implicit Places using invariants and state equation in 6836 ms returned []
Implicit Place search using SMT with State Equation took 7031 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-01 11:30:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/917 variables, and 496 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 426/922 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/917 variables, and 922 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in LTL mode , in 1 iterations and 67151 ms. Remains : 471/471 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin6933388285574674601
[2025-06-01 11:31:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6933388285574674601
Running compilation step : cd /tmp/ltsmin6933388285574674601;'/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 673 ms.
Running link step : cd /tmp/ltsmin6933388285574674601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6933388285574674601;'/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/stateBased7959988802916033619.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 11:31:53] [INFO ] Flatten gal took : 22 ms
[2025-06-01 11:31:53] [INFO ] Flatten gal took : 20 ms
[2025-06-01 11:31:53] [INFO ] Time to serialize gal into /tmp/LTL621302769644412582.gal : 5 ms
[2025-06-01 11:31:53] [INFO ] Time to serialize properties into /tmp/LTL16907021272208222581.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/LTL621302769644412582.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9546255942539776426.hoa' '-atoms' '/tmp/LTL16907021272208222581.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/LTL16907021272208222581.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9546255942539776426.hoa
Detected timeout of ITS tools.
[2025-06-01 11:32:09] [INFO ] Flatten gal took : 19 ms
[2025-06-01 11:32:09] [INFO ] Flatten gal took : 18 ms
[2025-06-01 11:32:09] [INFO ] Time to serialize gal into /tmp/LTL11901627109686467453.gal : 4 ms
[2025-06-01 11:32:09] [INFO ] Time to serialize properties into /tmp/LTL12017987587630805530.ltl : 7 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/LTL11901627109686467453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12017987587630805530.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((G(F("(reply_20_4_to_left_14<=newmsg17)")))U(G(("(reply_20_4_to_left_14>newmsg17)")U(("(election_20_3_5_to_right_4<=reply_15_0_to...234
Formula 0 simplified : X(FG!"(reply_20_4_to_left_14<=newmsg17)" R F(!"(reply_20_4_to_left_14>newmsg17)" R (!"(election_20_3_5_to_right_4<=reply_15_0_to_rig...224
Detected timeout of ITS tools.
[2025-06-01 11:32:24] [INFO ] Flatten gal took : 25 ms
[2025-06-01 11:32:24] [INFO ] Applying decomposition
[2025-06-01 11:32:24] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7523957056446488487.txt' '-o' '/tmp/graph7523957056446488487.bin' '-w' '/tmp/graph7523957056446488487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7523957056446488487.bin' '-l' '-1' '-v' '-w' '/tmp/graph7523957056446488487.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:32:24] [INFO ] Decomposing Gal with order
[2025-06-01 11:32:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:32:24] [INFO ] Removed a total of 53 redundant transitions.
[2025-06-01 11:32:24] [INFO ] Flatten gal took : 79 ms
[2025-06-01 11:32:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 14 ms.
[2025-06-01 11:32:24] [INFO ] Time to serialize gal into /tmp/LTL11451064093470128158.gal : 7 ms
[2025-06-01 11:32:24] [INFO ] Time to serialize properties into /tmp/LTL14859366472207065895.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/LTL11451064093470128158.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14859366472207065895.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((G(F("(gu16.reply_20_4_to_left_14<=gu16.newmsg17)")))U(G(("(gu16.reply_20_4_to_left_14>gu16.newmsg17)")U(("(gu34.election_20_3_5_...274
Formula 0 simplified : X(FG!"(gu16.reply_20_4_to_left_14<=gu16.newmsg17)" R F(!"(gu16.reply_20_4_to_left_14>gu16.newmsg17)" R (!"(gu34.election_20_3_5_to_r...264
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-06 finished in 343244 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(p0)))&&(p1||G(p0))))'
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 459/459 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 484 transition count 459
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 477 transition count 452
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 477 transition count 452
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 472 transition count 447
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 472 transition count 447
Applied a total of 26 rules in 55 ms. Remains 472 /486 variables (removed 14) and now considering 447/459 (removed 12) transitions.
// Phase 1: matrix 447 rows 472 cols
[2025-06-01 11:32:39] [INFO ] Computed 25 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:32:39] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-06-01 11:32:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:32:47] [INFO ] Implicit Places using invariants and state equation in 7220 ms returned []
Implicit Place search using SMT with State Equation took 7457 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-06-01 11:32:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 919/919 variables, and 497 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/919 variables, 427/924 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 919/919 variables, and 924 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 472/486 places, 447/459 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67626 ms. Remains : 472/486 places, 447/459 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Product exploration explored 100000 steps with 33333 reset in 283 ms.
Computed a total of 472 stabilizing places and 447 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 447
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 p1), (X p0), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-07 finished in 68521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 459/459 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 484 transition count 459
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 477 transition count 452
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 477 transition count 452
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 472 transition count 447
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 472 transition count 447
Applied a total of 26 rules in 30 ms. Remains 472 /486 variables (removed 14) and now considering 447/459 (removed 12) transitions.
// Phase 1: matrix 447 rows 472 cols
[2025-06-01 11:33:48] [INFO ] Computed 25 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:33:48] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-06-01 11:33:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:33:55] [INFO ] Implicit Places using invariants and state equation in 7376 ms returned []
Implicit Place search using SMT with State Equation took 7605 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-06-01 11:33: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/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 919/919 variables, and 497 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/919 variables, 427/924 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 919/919 variables, and 924 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 472/486 places, 447/459 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67733 ms. Remains : 472/486 places, 447/459 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Computed a total of 472 stabilizing places and 447 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 447
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), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-11 finished in 68544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 459/459 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 484 transition count 459
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 476 transition count 451
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 476 transition count 451
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 470 transition count 445
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 470 transition count 445
Applied a total of 30 rules in 32 ms. Remains 470 /486 variables (removed 16) and now considering 445/459 (removed 14) transitions.
// Phase 1: matrix 445 rows 470 cols
[2025-06-01 11:34:56] [INFO ] Computed 25 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:34:56] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-06-01 11:34:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:35:04] [INFO ] Implicit Places using invariants and state equation in 7067 ms returned []
Implicit Place search using SMT with State Equation took 7318 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-06-01 11:35:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 495 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 425/920 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 920 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 470/486 places, 445/459 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67438 ms. Remains : 470/486 places, 445/459 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-12
Product exploration explored 100000 steps with 242 reset in 207 ms.
Product exploration explored 100000 steps with 242 reset in 234 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1634 steps (0 resets) in 15 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 11:36:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 11:36:05] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 408 ms returned sat
[2025-06-01 11:36:09] [INFO ] [Real]Absence check using state equation in 3675 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-12 finished in 73051 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 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 459/459 transitions.
Graph (complete) has 922 edges and 486 vertex of which 484 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 203 place count 465 transition count 238
Reduce places removed 202 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 203 rules applied. Total rules applied 406 place count 263 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 407 place count 262 transition count 237
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 415 place count 254 transition count 229
Iterating global reduction 3 with 8 rules applied. Total rules applied 423 place count 254 transition count 229
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 3 with 2 rules applied. Total rules applied 425 place count 254 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 427 place count 252 transition count 227
Applied a total of 427 rules in 31 ms. Remains 252 /486 variables (removed 234) and now considering 227/459 (removed 232) transitions.
// Phase 1: matrix 227 rows 252 cols
[2025-06-01 11:36:09] [INFO ] Computed 25 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:36:09] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-01 11:36:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:36:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 11:36:13] [INFO ] Implicit Places using invariants and state equation in 3069 ms returned []
Implicit Place search using SMT with State Equation took 3255 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:36:13] [INFO ] Redundant transitions in 3 ms returned []
Running 191 sub problems to find dead transitions.
[2025-06-01 11:36:13] [INFO ] Invariant cache hit.
[2025-06-01 11:36:13] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 3/219 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 194/413 variables, 219/244 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/479 variables, and 254 constraints, problems are : Problem set: 0 solved, 191 unsolved in 26303 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 219/252 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 3/219 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 194/413 variables, 219/244 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 191/445 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 191 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 Int declared 413/479 variables, and 445 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 219/252 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56329ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 56330ms
Starting structural reductions in SI_LTL mode, iteration 1 : 252/486 places, 227/459 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59626 ms. Remains : 252/486 places, 227/459 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-14
Stuttering criterion allowed to conclude after 40708 steps with 164 reset in 69 ms.
FORMULA HirschbergSinclair-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-14 finished in 59748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G((!p0 U (p1||X(p1)))))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-20-LTLCardinality-06
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 486/486 places, 459/459 transitions.
Graph (complete) has 922 edges and 486 vertex of which 484 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 189 place count 465 transition count 252
Reduce places removed 188 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 191 rules applied. Total rules applied 380 place count 277 transition count 249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 383 place count 274 transition count 249
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 390 place count 267 transition count 242
Iterating global reduction 3 with 7 rules applied. Total rules applied 397 place count 267 transition count 242
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 3 with 2 rules applied. Total rules applied 399 place count 267 transition count 240
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 401 place count 265 transition count 240
Applied a total of 401 rules in 29 ms. Remains 265 /486 variables (removed 221) and now considering 240/459 (removed 219) transitions.
// Phase 1: matrix 240 rows 265 cols
[2025-06-01 11:37:09] [INFO ] Computed 25 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:37:10] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-06-01 11:37:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:37:12] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned []
Implicit Place search using SMT with State Equation took 2361 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-01 11:37:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 3/232 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/440 variables, 232/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 1/441 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/505 variables, and 258 constraints, problems are : Problem set: 0 solved, 204 unsolved in 23519 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/265 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 3/232 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/440 variables, 232/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 204/461 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 204 unsolved
SMT process timed out in 53564ms, After SMT, problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 53565ms
Starting structural reductions in LI_LTL mode, iteration 1 : 265/486 places, 240/459 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 55956 ms. Remains : 265/486 places, 240/459 transitions.
Running random walk in product with property : HirschbergSinclair-PT-20-LTLCardinality-06
Product exploration explored 100000 steps with 498 reset in 184 ms.
Product exploration explored 100000 steps with 512 reset in 218 ms.
Computed a total of 265 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 265 transition count 240
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), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 232 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (148 resets) in 220 ms. (180 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2025-06-01 11:38:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/211 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/228 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/434 variables, 228/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/441 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/505 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/211 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/228 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 434/505 variables, and 253 constraints, problems are : Problem set: 1 solved, 0 unsolved in 143 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 228/265 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 443 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 265 /265 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-01 11:38:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:38:08] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-01 11:38:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:38:10] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-01 11:38: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/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 3/232 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/440 variables, 232/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 1/441 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/505 variables, and 258 constraints, problems are : Problem set: 0 solved, 204 unsolved in 23856 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/265 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 3/232 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/440 variables, 232/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 204/461 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 204 unsolved
SMT process timed out in 53887ms, After SMT, problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 53887ms
Finished structural reductions in LTL mode , in 1 iterations and 56275 ms. Remains : 265/265 places, 240/240 transitions.
Computed a total of 265 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 265 transition count 240
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), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 17543 steps (63 resets) in 63 ms. (274 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 514 reset in 190 ms.
Product exploration explored 100000 steps with 528 reset in 210 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 265 /265 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:39:06] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2025-06-01 11:39:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 3/232 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/440 variables, 232/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 1/441 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/505 variables, and 258 constraints, problems are : Problem set: 0 solved, 204 unsolved in 23635 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/265 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 3/232 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/440 variables, 232/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 204/461 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 204 unsolved
SMT process timed out in 53664ms, After SMT, problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 53665ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53684 ms. Remains : 265/265 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin1790241827087979983
[2025-06-01 11:39:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1790241827087979983
Running compilation step : cd /tmp/ltsmin1790241827087979983;'/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 379 ms.
Running link step : cd /tmp/ltsmin1790241827087979983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1790241827087979983;'/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/stateBased17983925873113562281.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 265 /265 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-01 11:40:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:40:15] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-01 11:40:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:40:17] [INFO ] Implicit Places using invariants and state equation in 2096 ms returned []
Implicit Place search using SMT with State Equation took 2330 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-01 11:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 3/232 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/440 variables, 232/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 1/441 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/505 variables, and 258 constraints, problems are : Problem set: 0 solved, 204 unsolved in 23577 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/265 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 3/232 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/440 variables, 232/257 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 204/461 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 204 unsolved
SMT process timed out in 53614ms, After SMT, problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 53615ms
Finished structural reductions in LTL mode , in 1 iterations and 55951 ms. Remains : 265/265 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin309854157684076285
[2025-06-01 11:41:11] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin309854157684076285
Running compilation step : cd /tmp/ltsmin309854157684076285;'/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 383 ms.
Running link step : cd /tmp/ltsmin309854157684076285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin309854157684076285;'/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/stateBased3708720756307381389.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 11:41:26] [INFO ] Flatten gal took : 10 ms
[2025-06-01 11:41:26] [INFO ] Flatten gal took : 9 ms
[2025-06-01 11:41:26] [INFO ] Time to serialize gal into /tmp/LTL9284396900299257903.gal : 1 ms
[2025-06-01 11:41:26] [INFO ] Time to serialize properties into /tmp/LTL6499302157764813576.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/LTL9284396900299257903.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2960552202610832006.hoa' '-atoms' '/tmp/LTL6499302157764813576.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/LTL6499302157764813576.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2960552202610832006.hoa
Reverse transition relation is NOT exact ! Due to transitions t16, t22.t23, t26.t27, t32.t33, t38.t39, t42.t43, t47.t48, t51.t52, t57.t58, t63.t64, t69.t70...366
Computing Next relation with stutter on 5.49316e+14 deadlock states
Detected timeout of ITS tools.
[2025-06-01 11:41:41] [INFO ] Flatten gal took : 8 ms
[2025-06-01 11:41:41] [INFO ] Flatten gal took : 7 ms
[2025-06-01 11:41:41] [INFO ] Time to serialize gal into /tmp/LTL18042603212378681132.gal : 1 ms
[2025-06-01 11:41:41] [INFO ] Time to serialize properties into /tmp/LTL9223165980087661272.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/LTL18042603212378681132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9223165980087661272.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((G(F("(reply_20_4_to_left_14<=newmsg17)")))U(G(("(reply_20_4_to_left_14>newmsg17)")U(("(election_20_3_5_to_right_4<=reply_15_0_to...234
Formula 0 simplified : X(FG!"(reply_20_4_to_left_14<=newmsg17)" R F(!"(reply_20_4_to_left_14>newmsg17)" R (!"(election_20_3_5_to_right_4<=reply_15_0_to_rig...224
Reverse transition relation is NOT exact ! Due to transitions t16, t22.t23, t26.t27, t32.t33, t38.t39, t42.t43, t47.t48, t51.t52, t57.t58, t63.t64, t69.t70...366
Computing Next relation with stutter on 5.49316e+14 deadlock states
Detected timeout of ITS tools.
[2025-06-01 11:41:56] [INFO ] Flatten gal took : 11 ms
[2025-06-01 11:41:56] [INFO ] Applying decomposition
[2025-06-01 11:41:56] [INFO ] Flatten gal took : 7 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/graph4556642954515460732.txt' '-o' '/tmp/graph4556642954515460732.bin' '-w' '/tmp/graph4556642954515460732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4556642954515460732.bin' '-l' '-1' '-v' '-w' '/tmp/graph4556642954515460732.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:41:56] [INFO ] Decomposing Gal with order
[2025-06-01 11:41:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:41:56] [INFO ] Removed a total of 170 redundant transitions.
[2025-06-01 11:41:56] [INFO ] Flatten gal took : 18 ms
[2025-06-01 11:41:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 12 ms.
[2025-06-01 11:41:56] [INFO ] Time to serialize gal into /tmp/LTL7812681253530733527.gal : 3 ms
[2025-06-01 11:41:56] [INFO ] Time to serialize properties into /tmp/LTL10742583533595923.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/LTL7812681253530733527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10742583533595923.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...273
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(gu73.reply_20_4_to_left_14<=gu73.newmsg17)")))U(G(("(gu73.reply_20_4_to_left_14>gu73.newmsg17)")U(("(gu16.election_20_3_5_...274
Formula 0 simplified : X(FG!"(gu73.reply_20_4_to_left_14<=gu73.newmsg17)" R F(!"(gu73.reply_20_4_to_left_14>gu73.newmsg17)" R (!"(gu16.election_20_3_5_to_r...264
Reverse transition relation is NOT exact ! Due to transitions gu73.t97, gi3.gi0.t77_t78, gi3.gi0.t82_t83, gi3.gi0.t92_t93, gi3.gi0.t98_t99, gi3.gi1.gi0.t31...577
Computing Next relation with stutter on 5.49316e+14 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-20-LTLCardinality-06 finished in 302080 ms.
[2025-06-01 11:42:11] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13835823001494740344
[2025-06-01 11:42:11] [INFO ] Applying decomposition
[2025-06-01 11:42:11] [INFO ] Computing symmetric may disable matrix : 459 transitions.
[2025-06-01 11:42:11] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:42:11] [INFO ] Computing symmetric may enable matrix : 459 transitions.
[2025-06-01 11:42:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:42:11] [INFO ] Flatten gal took : 13 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/graph5645135435018185864.txt' '-o' '/tmp/graph5645135435018185864.bin' '-w' '/tmp/graph5645135435018185864.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5645135435018185864.bin' '-l' '-1' '-v' '-w' '/tmp/graph5645135435018185864.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:42:11] [INFO ] Decomposing Gal with order
[2025-06-01 11:42:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:42:11] [INFO ] Removed a total of 63 redundant transitions.
[2025-06-01 11:42:11] [INFO ] Computing Do-Not-Accords matrix : 459 transitions.
[2025-06-01 11:42:11] [INFO ] Flatten gal took : 27 ms
[2025-06-01 11:42:11] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:42:11] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13835823001494740344
Running compilation step : cd /tmp/ltsmin13835823001494740344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 11:42:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 5 ms.
[2025-06-01 11:42:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality6590155518199692757.gal : 4 ms
[2025-06-01 11:42:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality10917800697053292728.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/LTLCardinality6590155518199692757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10917800697053292728.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 1 LTL properties
Checking formula 0 : !((X((G(F("(gu16.reply_20_4_to_left_14<=gu16.newmsg17)")))U(G(("(gu16.reply_20_4_to_left_14>gu16.newmsg17)")U(("(gu33.election_20_3_5_...274
Formula 0 simplified : X(FG!"(gu16.reply_20_4_to_left_14<=gu16.newmsg17)" R F(!"(gu16.reply_20_4_to_left_14>gu16.newmsg17)" R (!"(gu33.election_20_3_5_to_r...264
Compilation finished in 988 ms.
Running link step : cd /tmp/ltsmin13835823001494740344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13835823001494740344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true))) U []((!(LTLAPp0==true) U ((LTLAPp1==true)||X((LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu16.t97, gi0.gi0.gi0.gu0.t398, gi0.gi0.gi0.gu1.t23, gi0.gi0.gi0.t25, gi0.gi0.gi1.gu2.t27, gi...1177
Computing Next relation with stutter on 1.9683e+15 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:08:16] [INFO ] Flatten gal took : 48 ms
[2025-06-01 12:08:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality17595901567768195939.gal : 3 ms
[2025-06-01 12:08:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality10177009822500476659.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/LTLCardinality17595901567768195939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10177009822500476659.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...299
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(reply_20_4_to_left_14<=newmsg17)")))U(G(("(reply_20_4_to_left_14>newmsg17)")U(("(election_20_3_5_to_right_4<=reply_15_0_to...234
Formula 0 simplified : X(FG!"(reply_20_4_to_left_14<=newmsg17)" R F(!"(reply_20_4_to_left_14>newmsg17)" R (!"(election_20_3_5_to_right_4<=reply_15_0_to_rig...224
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21...448
Computing Next relation with stutter on 1.9683e+15 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: LTL layer: formula: X(([](<>((LTLAPp0==true))) U []((!(LTLAPp0==true) U ((LTLAPp1==true)||X((LTLAPp1==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.022: "X(([](<>((LTLAPp0==true))) U []((!(LTLAPp0==true) U ((LTLAPp1==true)||X((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.023: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.115: There are 462 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.115: State length is 487, there are 473 groups
pins2lts-mc-linux64( 0/ 8), 0.115: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.115: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.115: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.115: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.257: [Blue] ~120 levels ~960 states ~12688 transitions
pins2lts-mc-linux64( 1/ 8), 0.275: [Blue] ~239 levels ~1920 states ~14512 transitions
pins2lts-mc-linux64( 1/ 8), 0.304: [Blue] ~479 levels ~3840 states ~17632 transitions
pins2lts-mc-linux64( 1/ 8), 0.349: [Blue] ~486 levels ~7680 states ~24520 transitions
pins2lts-mc-linux64( 1/ 8), 0.415: [Blue] ~486 levels ~15360 states ~38480 transitions
pins2lts-mc-linux64( 1/ 8), 0.531: [Blue] ~486 levels ~30720 states ~68000 transitions
pins2lts-mc-linux64( 1/ 8), 0.836: [Blue] ~486 levels ~61440 states ~126552 transitions
pins2lts-mc-linux64( 1/ 8), 1.782: [Blue] ~486 levels ~122880 states ~276376 transitions
pins2lts-mc-linux64( 1/ 8), 3.646: [Blue] ~486 levels ~245760 states ~621288 transitions
pins2lts-mc-linux64( 1/ 8), 7.139: [Blue] ~486 levels ~491520 states ~1380424 transitions
pins2lts-mc-linux64( 1/ 8), 13.637: [Blue] ~486 levels ~983040 states ~3258176 transitions
pins2lts-mc-linux64( 3/ 8), 25.848: [Blue] ~484 levels ~1966080 states ~6480760 transitions
pins2lts-mc-linux64( 1/ 8), 50.173: [Blue] ~486 levels ~3932160 states ~15361624 transitions
pins2lts-mc-linux64( 5/ 8), 98.469: [Blue] ~484 levels ~7864320 states ~30921240 transitions
pins2lts-mc-linux64( 5/ 8), 194.314: [Blue] ~484 levels ~15728640 states ~65910960 transitions
pins2lts-mc-linux64( 5/ 8), 390.927: [Blue] ~484 levels ~31457280 states ~141905136 transitions
pins2lts-mc-linux64( 5/ 8), 785.489: [Blue] ~484 levels ~62914560 states ~302620976 transitions
pins2lts-mc-linux64( 5/ 8), 1592.938: [Blue] ~484 levels ~125829120 states ~643924264 transitions
pins2lts-mc-linux64( 1/ 8), 1832.810: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1832.846:
pins2lts-mc-linux64( 0/ 8), 1832.846: Explored 138937629 states 789930042 transitions, fanout: 5.686
pins2lts-mc-linux64( 0/ 8), 1832.846: Total exploration time 1832.730 sec (1832.690 sec minimum, 1832.703 sec on average)
pins2lts-mc-linux64( 0/ 8), 1832.846: States per second: 75809, Transitions per second: 431013
pins2lts-mc-linux64( 0/ 8), 1832.846:
pins2lts-mc-linux64( 0/ 8), 1832.846: State space has 134217138 states, 634773 are accepting
pins2lts-mc-linux64( 0/ 8), 1832.846: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1832.846: blue states: 138937629 (103.52%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1832.846: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1832.846: all-red states: 634773 (0.47%), bogus 4393 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1832.846:
pins2lts-mc-linux64( 0/ 8), 1832.846: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 1832.846:
pins2lts-mc-linux64( 0/ 8), 1832.846: Queue width: 8B, total height: 3874, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 1832.846: Tree memory: 1208.4MB, 9.4 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1832.846: Tree fill ratio (roots/leafs): 99.0%/72.0%
pins2lts-mc-linux64( 0/ 8), 1832.846: Stored 510 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1832.847: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1832.847: Est. total memory use: 1208.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13835823001494740344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true))) U []((!(LTLAPp0==true) U ((LTLAPp1==true)||X((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13835823001494740344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true))) U []((!(LTLAPp0==true) U ((LTLAPp1==true)||X((LTLAPp1==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="HirschbergSinclair-PT-20"
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 HirschbergSinclair-PT-20, 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 r114-tall-174876422000083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-20.tgz
mv HirschbergSinclair-PT-20 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 ;